2: 1. If f(n) =n(n+1) and g(n)=200n^3 then ---------choose(f(n) belongs O(g(n)), f(n) belongs (g(n)). 2. Given C(n) = n(n^3 -1 )/2, we can write C(n) belongs ( ). 3. F(n) is in O(g(n) if there exist positive constant c and non-negative integer n0 such that f(n)..cg(n) for every n>- n0. 4. If f1(n) belongs O(g1(n)) and f2(n) belongs O(g2(n)), then f1(n) + f2(n) belongs O(..). 5. In divide and conquer algorithm, where the original problem is split into twi equal sized sub-problems, the recursive running time is: T(n) = _____T(n/__)+f(n). 6. In the worst-case scenario, traveling salesman problem will be______(choose: O(n!), ..) 7. In the worst-case scenario, the asymptotic performance of sequential search will be _____ 8. n^2 belongs _____(n^3) 9. In the worst-case scenario, Knapsack problem will be______ (choose: (2^n)) 10.BFS yields ______distinct ordering list of vertices, whereas DFS yields ________ distinct ordering list of vertices