Question 19 Considering the following recursive time, compute the final T(n) and T(n) complexity using forward or backward substitution Not yet answered Marked out of 2.00 T(n)-2 when nal p Flag question T(n)- T(n-1)+2 when n>1 Select one O a. T(n) 2n+2, O(n) O b. T(n) = 2n, (2n) O c. T(n) = 2n, O(n) d. T(n) = n, O(n) Question 20 The order of the best case of T(n) for factorial (n) algorithm Not yet answered Marked out of 150 Select one a. O(1) Flag question b 0(2) Og O(n) Od Only Question 21 The solution of the following Recurrence relation: = 8, annan is: Not yet answered Marked out of 2.00 Select one: =n(n-1)! Flag question oba, - 5 Oca,-87! Oda, -5n(n-1)(n-2) The permutation, a combinations or a subset are example on Question 22 Not yet answered Marked out of 1.50 Select one p Flag question O a. Geometric Problems ob Combinatorial problems Oo. Numerical problems d. Probability problems AUSB Course aashboard Question 23 Determine whether the following assertions are true or false n(n+1/2 belongs to O(n) Not yet answered Marked out of 150 Select one: Flag question O a True b. False Question 24 How many passes are required to sort a file of size n by bubble sort method? Not yet answered Marked out of 1.50 Select one na p Flag question b. 2n cin-1 0 d n/2 Question 25 Not yet answered Express the formula (n-1)*(n-5) in terms of big Oh notation Marked out of 150 p Flag question Select one: O a 0 (21) O b. o (n log n O c. O (2n) 0 0.0 (n) Question 26 The result of summation of numbers from i=1 to n is: Not yet answered Marked out of 1.00 Flag question Select one: O a. n(n+1)(2n+176 o b. n(n+1)/2 5 c. n n(n+1)/4 O d. 20-1