#write a function called rabbit_hole. rabbit_hole should have#two parameters: a dictionary and a string. the string may be#a key to the dictionary. the value associated with that key,#in turn, may be another key to the dictionary.##keep looking up the keys until you reach a key that has no#associated value. then, return that key.##for example, imagine if you had the following dictionary.#this one is sorted to make this example easier to follow: ## d = {"bat": "pig", "pig": "cat", "cat": "dog", "dog": "ant",# "cow": "bee", "bee": "elk", "elk": "fly", "ewe": "cod",# "cod": "hen", "hog": "fox", "fox": "jay", "jay": "doe",# "rat": "ram", "ram": "rat"}##if we called rabbit_hole(d, "bat"), then our code ## - look up "bat", and find "pig"# - look up "pig", and find "cat"# - look up "cat", and find "dog"# - look up "dog", and find "ant"# - look up "ant", and find no associated value, and so it would# return "ant".##other possible results are: ## rabbit_hole(d, "bat") -> "fly"# rabbit_hole(d, "ewe") -> "hen"# rabbit_hole(d, "jay") -> "doe"# rabbit_hole(d, "yak") -> "yak"##notice that if the initial string passed in is not a key in#the dictionary, that string should be returned as the result as#well.##note, however, that it is possible to get into a loop. in the#dictionary above, rabbit_hole(d, "rat") would infinitely go#around between "rat" and "ram". you should prevent this: if a#key is ever accessed more than once (meaning a loop has been#reached), return the boolean false.##hint: if you try to access a value from a dictionary that does#not exist, a keyerror will be raised

When the pc version of the spreadsheet program became available, the ibm pc quickly became the top-selling personal computer?

Lisa’s company, abc ltd., lost its biggest client and is now facing a financial crunch. most of her colleagues have resigned, but lisa decides to stay with the company and assist the management in overcoming the financial situation. which quality is lisa demonstrating? a. self-management b. cooperativeness c. responsibility d. loyalty

1. package newton’s method for approximating square roots (case study 3.6) in a function named newton. this function expects the input number as an argument and returns the estimate of its square root. the script should also include a main function that allows the user to compute square roots of inputs until she presses the enter/return key. 2. convert newton’s method for approximating square roots in project 1 to a recursive function named newton. (hint: the estimate of the square root should be passed as a second argument to the function.) 3. elena complains that the recursive newton function in project 2 includes an extra argument for the estimate. the function’s users should not have to provide this value, which is always the same, when they call this function. modify the definition of the function so that it uses a keyword parameter with the appropriate default value for this argument, and call the function without a second argument to demonstrate that it solves this problem. 4. restructure newton’s method (case study 3.6) by decomposing it into three cooperating functions. the newton function can use either the recursive strategy of project 1 or the iterative strategy of case study 3.6. the task of testing for the limit is assigned to a function named limitreached, whereas the task of computing a new approximation is assigned to a function named improveestimate. each function expects the relevant arguments and returns an appropriate value. 5. a list is sorted in ascending order if it is empty or each item except the last one is less than or equal to its successor. define a predicate issorted that expects a list as an argument and returns true if the list is sorted, or returns false otherwise. (hint: for a list of length 2 or greater, loop through the list and compare pairs of items, from left to right, and return false if the first item in a pair is greater.)