2. Assume the node is in the usual info-link form with the info of type int. (list and ptr are pointers of type nodeType) list new nodeType; list->info 10; ptr new nodeType; ptr->info 13; ptr->link NULL; list->link ptr; ptr = new nodeType; ptr->info ptr->link list->link 18; list->link; ptr; cout < < list->info < < " " < < ptr->info < < " "; ptr ptr->link; cout < < ptr->info < < endl; a) Show the output produced by the C++ code. (3 marks) b) Draw a diagram of the linked list after this code executes. (3 marks)