Problem 1. Construct a non-recursive procedure capable of reversing a single linked list of n elements, which runs in O(n) time. Can the same be achieved in (n) time? If so, construct it. Problem 2. Using the procedure TREE-SUCCESSOR and TREE-MINIMUM, write a function F(x), where x is a node in a binary search tree, to produce the output that INORDER- TREE-WALK function would produce. Determine the upper bound running time complexity of F(x) and prove its correctness. Problem 3. Let n be an integer. Write dynamic programming algorithm which determines in how many ways, with repetitions, can n be written as the sum of 1,2,4 and prove its time complexity.

Problem 1. Construct a non-recursive procedure capable of reversing a single linked list of n elements, which runs in O(n) time. Can the same be achieved in (n) time? If so, construct it. Problem 2. Using the procedure TREE-SUCCESSOR and TREE-MINIMUM, write a function F(x), where x is a node in a binary search tree, to produce the output that INORDER- TREE-WALK function would produce. Determine the upper bound running time complexity of F(x) and prove its correctness. Problem 3. Let n be an integer. Write dynamic programming algorithm which determines in how many ways, with repetitions, can n be written as the sum of 1,2,4 and prove its time complexity.