Hello, Could you please help me elaborate on "Running Time Complexity", "Space Complexity", and "Big-Oh Notations"? The problem attached asks for both f (n) and g (n) which I have no idea what they...

Hello,

   Could you please help me elaborate on "Running Time Complexity", "Space Complexity", and "Big-Oh Notations"?

   The problem attached asks for both f (n) and g (n) which I have no idea what they are about. All I currently know is that since every "i" runs n. times as "j" iterates, and "i" itself runs for n times, the Big-Oh notation of the running time for the problem should be O (n * n) = O (n^2). However, how can I express the answer in f (n) and g (n) format? Could you please help me with this?

Extracted text: Analyze the following for-next loop statements and give (1) the precise f (n) with n being the input and (2) the big-O notation for each expression, i.e., g (n). for i = 1 to n; = 1 to n; for j X := x + 1;