/** Return the smallest number in a list. * @pre !nums.isEmpty() * @return the smallest number in `nums`. */ static Double myMin( List nums ) { // initialize our loop-variables: double minSoFar = nums.get(------); List numsRemaining = nums.subList(------- ,nums.size());

while ( ------------- ) { double a = numsRemaining.get(0); // corresponding to Scotts variable `a` minSoFar = ( ----------------- ? ---------------- : -------------- ); numsRemaining = ; } return minSoFar; }

using corresoonding variable name, convert the above code to a tail-recursive racket function.