Given the dynamic linked implementation of a linked list shown below, write expressions that do the following, assuming that currPtr is somewhere in the middle of the list:
a. Access the component member of the first list element.
b. Advance currPtr to point to the next element.
c. Access the component member of the next element (the one that follows the current element).
d. Access the component member of the element that follows the next element.
typedef int ComponentType;struct NodeType;typedef NodeType* NodePtr;struct NodeType{ ComponentType component; NodePtr link;}NodePtr lastPtr;NodePtr listPtr;NodePtr currPtr;NodePtr newNodePtr;
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.