Consider a linked chain of three nodes, such that each node contains a string.The first node contains "A", the second node contains "B", and the third node contains "C".

a. Write C++ statements that create the described linked chain. Beginning with a head pointer headPtr that contains nullptr, create and attach a node for "C", then create and attach a node for "B", and finally create and attach a node for "A".
b. Repeat part a, but instead create and attach nodes in the order "A", "B", "C".

```
// Part a: Create nodes for C, B, and A; insert nodes at beginning of chain.
headPtr = new Node("C");
Node* newNodePtr = new Node("B");
newNodePtr->setNext(headPtr);
headPtr = newNodePtr;
newNodePtr = new Node("A");
newNodePtr->setNext(headPtr);
headPtr = newNodePtr;
// Part b: Create nodes for A, B, and C; insert nodes at end of chain.
headPtr = new Node("A");
Node* newNodePtr = new Node("B");
headPtr->setNext(newNodePtr);
Node* lastNodePtr = newNodePtr;
newNodePtr = new Node("C");
lastNodePtr->setNext(newNodePtr);

```