1.) Write a function called last that finds the last node in the list.
2.) Write a function called count that gets the length of linked list. Don't use the #count method.
3.) Write a function called average that sums a linked list of numbers and divides it by the length.
4.) Write a function to reverse a linked list.