Write a script $($in the file testprintlist.py$)$ that tests this function and add code to trace the argument on each call. Does this function work as expected? If so$,$ how does it works, and describe any hidden costs in running it$.$ Before each recursive call, the function creates a slice of its nonempty list argument. The hidden cost is that each slice produces a copy of the list, less its first item. This process requires time and memory. Is recursion actually a loop? Do developers have to use recursion or is it just an option?