1. Explain Double Hashing with an example. Give your own data. (3 marks) 2. What is Balanced Binary Tree. Explain with your own example. (3 marks) Write the complexity of Balanced Binary Tree. 3. Discuss Bucket Sorting Algorithm. (4 marks) Explain with your own example. Write an algorithm. Write the complexity Note: Every example must be with your own data. Write your answers in Ms-Word file and upload the same file in E-Learning.

Problem: 1. Explain Double Hashing with an example. Give your own data. (3 marks) (3 marks) 2. What is Balanced Binary Tree. Explain with your own example. Write the complexity of Balanced Binary Tree. . (4 marks) . 3. Discuss Bucket Sorting Algorithm. Explain with your own example. Write an algorithm. Write the complexity . . Note: Every example must be with your own data. Write your answers in MS-Word file and upload the same file in E-Learning