Write an algorithm for

  Write an algorithm for the add method that will add at the end of the list instead of the beginning. What is the time complexity of this algorithm? 

Modify the algorithm from the previous exercise so that it makes use of a rear reference. How does this affect the time complexity of this and the other operations?