Write a short code to properly delete the node at the beginning of the list(with data=10) in the list below (Figure 5) in other words. After your code executes, the lost will contain nodes with the following data: 12 & 20 Knowing that class node is defined as follows: Class Node } Public: double data; Node* next; }; And head is a pointer to the first node in the list. data next data next data next 10 12 20 head A) redraw the max-heap below (figure 3) after deleting the root. 97 90 00 93 79 42 55 73 21 83 83 84 54 83 81 B) redraw the min-heap below) Figures 4, after inserting a node that contains 18: 32 14 5 23 41 87 90 50 64 53 43