O (CLOS-4) Solve the recurrence by substitution method xx*(n/5)+1 for n>1 and (n=5 Marks 5) ont (CLOS-4) Master theorems apply on these expressions. (Marks 2-5) TO) - 4T(1/3)+7 To) - Tn/2) +21 Tn)=2nTn 2) + n Tn) = 16Tn/4+ 10m ca) - 2T(n/2)+nlogn QUI (CLOS-1) Briefly explain dynamic programming and Branch and Bound. (2.5) QRIL (CLOS-2)-Evaluate True and False of below expression with reason? (Marks 2.5) 4 On)=0 (B) b. O(n) -(0) C. 2 (nlogn) = On) d. Onlogn) =D(nlogn) e. O(n) = 12(1100) 0212 (CLOS-3) Solve the complexity by sunimation. [2.5 Marks] for 1 to a=b+c-1 1 fori - I to a=b+c-1