1. What is the time complexity of this pseudocode? Algorithm Algo2 (A) Input: An nxn matrix of integers of integers with n >1 Output: The sum of the integers in the matrix S = 0 For i = 1 to for i=1...

1. What is the time complexity of this pseudocode? Algorithm Algo2 (A) Input: An nxn matrix of integers of integers with n >1 Output: The sum of the integers in the matrix S = 0 For i = 1 to for i=1 to n do for j=1 to n do s=s+ A [ i ] [ j ] return s O(1) O(n log n) O(log n) O(N^2) 2. What is the time complexity of the instructions in this pseudocode? Somefunc (int n) { int y = 5; for {i = 0; i t Otherfunc( ) ; //this function is independent of n int z = 9; y++t } Return y; O(n) O(1) O(n*n) O(log(n)) 3. What is the time complexity of this pseudocode? For(int i =1; { Int k = n; While (jk>= 1) Count k /= 2; } Cout } O(log(n)) O(n*n) O(n*log(n)) O(n*m) Can someone please explain how to complete each step - I want to fully understand how to solve these.