The first part is binary heaps and the steps are given. Solve neatly on a piece of paper. The second part is binary search trees. Solve that on a different paper neatly. These 2 questions are not related to each other so solve them accordingly and on different sheet of paper.

Binary Heaps: 1. Insert the values 13, 3, 4, 12, 14, 10, 5, 1, 8, 2, 7, 9, 11, 6, 18}, starting from 13, in a MinHeap, Draw the MinHeap neatly. 2. Redraw the MinHeap of Part 1 after deleting the root node. Binary Search Trees: 1. Insert the values {13, 3, 4, 12, 14, 10, 5, 1, 8, 2, 17, 19, 21, 16, 18, 18), starting from 13, in a BST. Draw the BST neatly. 2. Redraw the BST of Part 1 after deleting the node with value 17