3. Build a Min Heap from the given array Mimo. Write an algorithm for building the Min Heap (Min-Heapify). Mimo [10] = {1, 4, 2, 6, 3, 5, 7, 9, 8, 10} 4. Draw Breath First Search Tree and Depth First Search Tree corresponding to the graph given below: A B H E F G