1. What are Divide and Conquer algorithms? Describe how they work. 2. How do Insertion sort, Heapsort, Quicksort, and Merge sort work? 3. What are the key advantages of Insertion Sort, Quicksort, Heapsort and Merge sort? 4. What is a Hash Table, and what is the average case and worst-case time for each of its operations? 5. What is the difference between dynamic programming and recursive?.