PYTHON 3: Iterators and Iterator Decorators via Generators **if an argument is iterable, it means that you can call only iter on it, and then call next on the value iter returns (for loops do this automatically). There is no guarantee you can call len on the iterable or index/slice it. You may not copy all the values of an iterable into a list (or any other data structure). You may create local data structures storing as many values as the arguments or the result that the function returns, but not all the values in the iterable. Define a generator named min_key_order whose parameter is a dict that has keys that can all be compared with each other (e.g., all numbers, all strings, etc; dont check this property). The min_key_order generator produces a 2-tuple of the dicts keys and values, in increasing order of the keys. For example: it would be trivial to write this generator as but the generator must have one more property: it must iterate over mutations made to the dict while the dict is being iterated over. That is NICE TO KNOW / HINTS: Note that the process of iterating through the dict should not mutate the dict (although the dict can be mutated directly by code during the iteration, as is shown above), Hints: The first time next is called, find the minimum key in the dict (it is unique, if the dict isnt empty) and yield it and the key and its value first; later, repeatedly find the smallest key bigger than the previously yielded key (so long as there is one) and yield the key and its value; you may create a local list/tuple whose length is no bigger than the dict (although there is a way to solve this problem without such a data structure, but it requires more code).

for i in min key-order ({1: 'a', 2: '', 4: 'm', 8: 'd', 16:'f'): print (i , end-') prints: (1, 'a') (2, 'x') (4, 'm') (8, 'd') (16, '') for i in min key-order ({1: 'a', 2: '', 4: 'm', 8: 'd', 16:'f'): print (i , end-') prints: (1, 'a') (2, 'x') (4, 'm') (8, 'd') (16, '')