Show and draw the trace diagram from the following C++ codes. Assume that the node consists of two members, data and next with the data of the type int (list and ptr are pointers of the type node). i) ptr=new node; ii) ptr->data=28; iii) ptr->next=NULL; iv) list = new node; v) list->data=56; vi) list->next=ptr; vii) ptr=new node; viii) ptr->data=68; ix) ptr->next=list; x) list=ptr; xi) ptr=new node;

xii) ptr->data=62; xiii) ptr->next=list->next; xiv) list->next=ptr; xv) ptr=list; xvi) ptr=new node; xvii) ptr->data=70; xviii) ptr->next=list->next; xix) list->next=ptr; xx) ptr=list; xxi) while(ptr!=NULL) { cout<data<next; }