Remember to account for zero-based indexing. To compute a necessary size of an array, add one to the largest index 7. Consider using dynamic programming to rewrite this function: function g(s,1,t,j) 1f .length) return 0 If (j : t . length) return 0; trn maximum g(s,1-1.t,j).gs,1,t,-); else return 1 + g(s,1+1,t,j+1); Assume the use of a table lookup function that incorporates the base cases. What are the largest indices of the dynamic programming table? (A) none of the other answers are correct (B) (s.length) and (t.length+1) (C) (s.length+1) and (t.length) (D) s.length and t.length (E) (s.length+1) and (t.length-1) (F) (s.length-1) and (t.length-1) (G) (s.length+1) and (t.lengt1) 8. Continuing from the previous question, how is the dynamic programming table filled? Assume the rows are associated with i and the columns are associated with j. (A) rows from low to high and columns from high to low (C) rows from high to low and columns from high to low B) rows from high to low and columns from low to high (D) rows from low to high and columns from low to high