Show and draw the trace diagram for the C++ code below. Assume that the node consists of two members, data (type int) and link. (link, head, temp and ptr are pointers of the type node). 53 35 NULL head struct node { int data; node *link; } *head, *ptr, *temp; i. ptr = new node; ptr -> data 77; ii. ptr -> link = head -> link; iii. head -> link = ptr; iv. temp new node; temp -> data = 22; V. temp -> link = NULL; ptr -> link -> link = temp; vi. temp new node; temp -> data = 105; vii. temp -> link = ptr -> link; head -> link = temp; ptr -> link = NULL; delete ptr; viii. ptr head; while (ptr != NULL) { coutdata link; }