What are the time and space complexities of the following algorithm? int getSum(int[] array) { int size = array.length; int sum = 0; for (int iterator = 0; iterator < size; iterator++) { sum += array[iterator]; } return sum; } Question 6 options: O(n5) Both of O(n) Error for the time and O(n^2) for the space For the space O(n.logn) and time is O(log n) Both O(n^2) Both O(1)

Given the following algorithm:

 void func(int n){ int index=0, i=1,j=1; for( i=1; i 
Question 5 options:
 
 
 
 
 
 
 
 
 
 
 
This algorithm is faster than O( 5*(n2) ) but slower than O(n2).
 
 
 
 
 
 
 
 
 
 
 
 
 
This algorithm is faster than O( n*log2(n2) ) but slower than O(n2).
 
 
 
 
 
 
 
 
 
 
 
 
 
This algorithm is faster than O(n) but slower than O(log2(n)).
 
 
 
 
 
 
 
 
 
 
 
 
 
This algorithm is faster than O(n2) but slower than O(n*log2(n)).