Ch3:\ R-3.5 - Be specific, what happens when we try to add a node after we've removed the last node? What if we then try to immediately remove the node we just added? Specifically say what happens to the tail pointer after we use removeFirst() to remove the last element of a list. Then what happens to tail if we addFirst()? What if we addLast()?\ R-3.6 - Your solution should work on an empty list (return null or throw an exception), as well as a list with only one element (return null or throw an exception). Do NOT use the size method. Give pseudocode.