Give a big-Oh characteristics in terms of n, of the running time of the loop method for
1) Algorithm loop2(n):
p = 1
for i = 1 to 2n do
p =p*i
2) Algorithm loop3(n)
p=1
for i = 1 to n^2 do
p = p*i
3) Algorithm loop4(n)
s = 0
for i =1 to 2n do
for j = 1 to i do
s= s + i
4) Algorithm loop5(n)
s = 0
for i =1 to n^2 do
for j = 1 to i do
s= s + i