Compute BigOh for the following code fragments. You do not have to write code for this assignment.

 #1 for(int i=0; i < n + 5; ++i) for(int j=0; j < i + i; j++) Console.WriteLine(); 

#2 for(int i=0; i < n * 5; ++i) for(int j=0; j < i * i; j++) Console.WriteLine(); 

#3 Compute BigOh for the following recurrence relation: T(n)=2T(n/2) + 2 where T(1) = 1