$(6$ points$)$ Using a linked list, implement a List ADT that supports the following

operations:

insertHead: insert a new node at the head of the list

deleteHead: return the data of the head node, and delete the head node

insertTail: insert a new node at the tail of the list

deleteTail: return the data of the tail node, and delete the tail node

insertSecondLast: insert a new node right before the tail

deleteSecondLast: return the data of the second$-$to$-$the$-$last node, and delete that node $.$ Use c$++$