You will need to implement the function longest_sequence as appears in box2.py which can be download from the link below. See the file for a full description of the task.
Do not change the declaration of the longest_sequence function. You may add helper functions to the same file if you think it will help. For full marks, your implementation should run in O(n2 ) time. Also, regardless of the running time you achieve, a small part of the marks is allocated to running time analysis. At the bottom of box2.py, you will see a comment prompting you to briefly analyze the running time. You should put a statement of the running time plus a brief justification (2-3 sentences) in a comment at the bottom of your code.
Submit your implementation as box2.py. Do not zip it!
box2.py
1 of 1 , 1:03 p.m.
