Part A: Sketching a linked list data structure

Draw a sketch of a singly linked list after the following code is executed. Remember to sketch the head pointer, each node, and each node's contents.

SLinkedList words;

words.addFront(we);

words.addFront(are);

words.removeFront();

words.addFront(the);

words.addFront(people);

Part B: iterating through a linked list:

For the Singly-Linked List class at:

https://github.com/apanangadan/CSUF-CPSC_131/blob/master/SLinkedList.h

Add a function/method called printEveryOther that prints every other element starting from the first. The function should throw an exception for possible error cases. Show only this new function. (Note: you can test your code by calling this function from the main function).