Consider the linked list shown in Figure. Assume that the nodes are in the usual info-link form. Use this list to answer Exercise. If necessary, declare additional variables. (Assume that list, p, s, A, and B are pointers of type nodeType.)
FIGURE 5-35
Linked list for Exercise

If the following C++ code is valid, show the output. If it is invalid, explain why.
a. s = A;
p = B;
s->info = B; p = p->link;
cout ≪ s->info ≪ " " ≪ p->info ≪ end1;
b. p = A;
p = p->link;
s = p;
p->link = NULL;
s = s->link;
cout ≪ p->info ≪ " " ≪ s->info ≪ end1;
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.