3. Answer each of the short questions: a) For 1000 sorted data, what will be the worst case runtime if you use Binary Search Algorithm. First use the right formula and then compute. b) For the same problem as above, if you use Binary Search Tree algorithm, how would the runtime be different as compared to the Binary search Algorithm? Again use the correct formula and find it out. c) Given the following Binary search Tree: (The root is 50 , it is not showing up correctly on the image below) You need to write down the pre-order and post-order data arrangements. d) Illustrate from the tree given in part (c ) how would you delete the root, and what will be the new tree look like. Explain the algorithm for deleting the root. 3. Answer each of the short questions: a) For 1000 sorted data, what will be the worst case runtime if you use Binary Search Algorithm. First use the right formula and then compute. b) For the same problem as above, if you use Binary Search Tree algorithm, how would the runtime be different as compared to the Binary search Algorithm? Again use the correct formula and find it out. c) Given the following Binary search Tree: (The root is 50 , it is not showing up correctly on the image below) You need to write down the pre-order and post-order data arrangements. d) Illustrate from the tree given in part (c ) how would you delete the root, and what will be the new tree look like. Explain the algorithm for deleting the root