Suppose we have an oracle for ATM. On input x ∈ {0, 1} ∗ , I’ll explain how to compute k = K(x) using O(2k ) oracle calls. Show how to do it with only O(k) oracle calls. (Or even better, O(log k) oracle calls!)

Write a defining table and then a program that determines if you can sleep in or not. your program should get all its input from your computer’s clock. on all weekdays (monday through friday) that are not holidays, your program should output “get up! ” on all other days (weekends and holidays), your program should output “sleep in.” the three holidays that your program must check for are january 1 (new year’s day), july 4 (u.s. independence day), and december 25 (christmas). you don’t need to include other holidays in your program because most other holidays do not occur on a fixed day each year.