Please ecplain. Please use Python version 3. Thanks

4. (Nice sequences, 15pt) Here is a nice number puzzle, for more on the puzzle, see this blog post. You are trying to find the longest sequence of numbers so that all numbers are between 1 and 100 (inclusive) no number is repeated every number (except the first) divides the number before it, or is a multiple of it. A sequence satisfying these properties is called nice. For example, 4, 2, 18, 6, 3 is a nice sequence. 4, 400 is not (violates first condition). Write a program nice(lst) that takes a list of numbers and returns True if and only if the sequence it is given is nice. Python 3.5.2 Shell File Edit She Debug Options Window Help >> nice ([5,1,200,50]) False >nice (I5, 1,100,50,101) True >>>nice (I5,1,100,50,10,51) False >>nice ([5,1,100,25,5]) False >nice ([5,1,25, 5,14,7]) False Ln: 7 Col: 23 Note: The goal of the puzzle is to find as long a nice sequence as possible (this is not part of your homework, though you're welcome to