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

Mark each of the following statements as valid or invalid. If a statement is invalid, explain why.
a. A = B;
b. list->link = A->link;
c. list->link->info = 45;
d. *list = B;
e. *A = *B;
f. B = A->link->info;
g. A->info = B->info;
h. list = B->link->link;
i. B = B->link->link->link;
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.