• This quiz is SOLO.
• This portion is worth 100 pts.
• No notes, books, web sites (except reading this quiz and accessing Autolab).
• IDLE hint:  python -m idlelib.idle &
• Autolab hint (to submit):  http://autolab.cs.cmu.edu/
• You must submit your quizd.py file to Autolab before leaving the lab!  You will not have access to this file after you leave the lab!
• To start, download this one file: quizd.py
• The private autograder you have is "very nearly" the final version.  We will keep the same tests worth the same points, but the constants will be changed when we autograde after the quiz so you cannot just hardcode the answers.
• You may use up to 5 submissions during the quiz, though (as always) your last submission is the only one that counts.  Obviously, you may not submit nor resubmit after you leave the lab (do not attempt to do so, even if Autolab for some reason allows it).
• Good luck! :-)

Edit the 8 functions as instructed in quizd.py.  Each is worth 12.5 points.

1. Add a doc string to f1
2. Use an optional parameter in f2
3. (Properly) Use variable-Length args in f3
4. Make f4 a custom comparator function.
   Create a comparator function so that, when used it sorts a list of integers in reverse (largest first)
5. Make f5 return an anonymous (lambda) function that takes a number x and returns 2*x.
6. Make f6 take a function f, and return another function (defined within a closure), so that the returned function takes a value x and returns the smallest int value y, where y>=x, such that f(y)==0.
7. Make f7 solve the Towers of Hanoi. f7(n) should return a list of (from,to) pairs so that making those moves in order would move n disks from post 0 to post 1.
8. Make f8 take a list L and return the powerset of L.  That is, a list of all possible sublists of L.

carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem   -   carpe diem