You are asked to derive an IntQueue class from the LinkedList class you have. The class will be

used only for int values and implements the FIFO policy. The add$($int val$)$ function will enqueue

val $($you need to use a tail pointer here$)$ and the get$($int& val$)$ will dequeue the Node pointed by

the head pointer; the value will be stored in val. $(15$ pts$)$