Write a tail-recursive function in Oz that takes a list (and possibly other parameters to make it tail-recursive) and returns the length of the list.
Write a tail-recursive function in Oz that takes a list of numbers that has at least one element and returns the smallest element in the list. The function must raise an exception takingMinOfAnEmptyList if given an empty list. Do not handle any other error cases.
Submit your file(s) to me by e-mail. The subject must be
Problem Set N, where N is the problem set number.
Handwritten problems can be scanned and attached (good quality scanning, please!) or submitted
in class or in my office in person. If submitting handwritten work, please clearly write
your name and problem set number on it.