(20 points) Linked lists (a) Write an algorithm to find the maximum value in a linked list. (b) Provide the O, , and bounds on finding the maximum value in a linked list. (c) Are the bounds the same for searching a linked list? Why or why not? (d) Write a proof by contradiction to explain your answer to part c. (e) Write an inductive proof for correctness and complexity for searching a linked list. (f) Write a loop invariant proof for the same problem as part d