Discrete Mathematics Help! Big theta notiation and psuedocode of loops.

please answer a) i) ii) b) i) ii) and c) i) ii) there should be 6 answers and please explain!

3. (a) Consider the procedure procedure Loopsl (n, a positive integer) 1. for i 1 to n 2. for i 1 to n print (i,j) 3. i. In terms of n, how many ordered pairs are printed? ii. What is the runtime in e notation of this procedure? (b) Consider the procedure procedure Loops2 (n, a positive integer) 1. for k 1 to 2. for 1 to n for i i 1 to n 3. prints (i,j) i. In terms of n, how many ordered pairs are printed? ii. What is the runtime in e notation of this procedure? (c) Consider the procedure procedure Loops3(n, a power of 2) 1. for 1 to n i 3. while j> 1 print (i,j) i. In terms of n, how many ordered pairs are printed? ii. What is the runtime in e notation of this procedure