answer the following 5. The maximum number of nodes at level n for a binary tree is:C. 2"A. nВ. 2пD. n + 16. For analyzing an algorithm, which is better computing time?A. 0(100 Log N)B. 0(2N)C. 0(N Log N)D. O(N²)7. Which of the following is not as a quadratic sorting algorithm?A. Bubble sortB. Selection sortC. Quick sortD. Insertion sort8. Which data structure allows deleting data elements from front and inserting at rear?A. StacksB. QueuesC. Binary search treesD. Hash tables9. Which of the algorithm design approach is used by Quick sort and Merge sortA. Branch and bound approachB. Greedy approachC. Dynamic approachD. Divide and Conquer approach10. Which of the following is the recurrence equation for the worst case time complexity of thequick sort algorithm for sorting n (2 2) numbers ? where c is a constantА. Т(п) — 2T (n/2) + спВ. Т(п) — т(n/2) + спС. Т(п) — 2T (n - 2) + спD. T(n) = T(n-1) + T(1) + cm

5.The maximum number of nodes at level n for a binary tree is 6.For analysing an algorithm, better…

5. The maximum number of nodes at level n for a binary tree is:| А. п В. 2n C. 2" D. n + 1 6. For analyzing an algorithm, which is better computing time? A. O(100 Log N) В. О(2N) C. 0(N Log N) D. 0(N²) 7. Which of the following is not as a quadratic sorting algorithm? C. Quick sort A. Bubble sort B. Selection sort D. Insertion sort 8. Which data structure allows deleting data elements from front and inserting at rear? C. Binary search trees D. Hash tables A. Stacks B. Queues 9. Which of the algorithm design approach is used by Quick sort and Merge sort A. Branch and bound approach C. Dynamic approach