T-Mobile * 63%- 11:15 AM blackboard.rutgers.edu 1. Insert 22, 78, 10, 56,12, 7, 8, 35,63 into the Min- Heap. Also write the java code for the insertion method. 2. Define Huffman coding technique. Construct a Huffman coding tree using the given Letters and frequencies below. Also, Write down the C DEK L M UZ Frequency 32 42 120 7 42 24 37 2 3. Explain Quick sort, and shell sort with examples how to sort any 8 integers) and java code on both QuickSort and ShellSort. Give any 1 Real world application. . Explain Merge Sort, and Bubble sort with examples (how to sort any 8 integers) and java code on both MergeSort) and BubbleSor0. Give any 1 Real-world application. 5. Explain Insertion Sort, and Selection sort with examples (how to sort any 8 integers) and java code on both Insertion Sort0 and Selection sort0. Give any 1 Real-world application. 6. Define B-Trees. Create a B-Tree of order 5 using the keys: 10,40,30,35,20,15,50,28,25,5,60,19,12,38,27,90,45 48. Write the algorithm for the Insertion 0. 7. Define 2-3 Trees. Insert 1 to 12 into a 2-3 Trees and write the algorithm for the Insertion 0. 8. Find the BFS and DFS for the below graph. Also write the pseudocode for both