Code this on matlab!

use this skeleton given to us ! Thanks!

3 Binary Heap - minHeap We will now work with another data structure, called a binary heap. Our implementation of the binary heap will be considered a min heap. A min heap uses the binary tree structure with parents having lower values than their two children. Jargon This section is a general introduction to the binary heap and the jargon that we will be using. There are multiple ways to implement binary trees. Binary trees can be thought of as a 'tree' of nodes. The top of Figure 2 can help you visualize the binary tree structure. 1 5 2 3 Q10 3 9 1 4 6 5 7 Figure 2: A Binary Heap Tree Example The bottom half of Figure 2 will is a representation of the array format we will utilize for our min heap implementation. Nodes are represented in red (outside the circle) and values are represented in black (inside the circle). Node 1, the root or parent, has two children: node 2, the left child,