▾ Problem 1 Write a generator for the Fibonacci Numbers Build a generator that returns the Fibonacci numbers: 0, 1, 1, 2, 3, 5, and so on. [] def fibonacci generator(): ***Generates all Fibonacci numbers.*** YOUR CODE HERE File "cipython-input-11-7871f3cb2039>", line 5 SyntaxError: invalid syntax SEARCH STACK OVERFLOW [] Here you can test your code. what you write here will be removed. visible tests: 5 points r=[] for nin fibonacci generator(): r.append(n) if n > 100: break assert ♬ = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144] [ ] Hidden tests, 5 points These tests check basically that you generate Fibonacci numbers, forever without stopping. It is the reader (the user) of the function that decides when to stop.

def ppv(tp, fp): # TODO 1 return   def TEST_ppv(): ppv_score = ppv(tp=100, fp=3) todo_check([ (np.isclose(ppv_score,0.9708, rtol=.01),"ppv_score is incorrect") ])   TEST_ppv() garbage_collect(['TEST_ppv'])

Assume int[] t = {0, 1, 2, 3, 4, 5}; What is t[6]?   undefined, there is an error in this code 4 6 5

7. username_ends_with_digits This function decides whether a given username ends with some digits. It returns either True, if the username does end with digits, or False, if it does not. Check out the .isdigit method on strings! Sample runs should look like: >>> username_ends_with_digits("FunctionEnjoyer") False >>> username_ends_with_digits("this_username_95060") True