(i) Give the initial starting tableau for the 2-phase simplex algorithm for this program.

2. R(N) is the running time of strange_sum when called on a List of length N. Since this is recursive code, your answer to iii should include a diagram of the recursion tree. a. Answer for li being an ArrayList b. Answer for li being a LinkedList static int strange_sum(List li) { return strange_sum_helper(li, 0, li.size() - 1); static int strange_sum_helper (List arr, int left, int right) { if (right - left < 0) return 0; else if (right else { int mid = (left + right) / 2; return strange_sum_helper(arr, left, mid) left 0) return arr.get(left); == + strange_sum_helper(arr, mid + 1, right); } }

ii.Building on your decomposition for part c.i., develop an algorithm for solving the problem. Include this algorithm in your solution document, and also write down your PI and the individual number that you have obtained via Steps 1–3 from your PI H5737055