Consider the following recursive function that takes as arguments an array L and two non- negative integers first and last, that serve as indices into L. Therefore, if L has length n, then first and last are guaranteed to be in the range 0 through n - 1. function strangeSum(L, first, last) if (last