In this part of the question, you will implement the final steps in the top-level decomposition given at the beginning of this question:

• >> Find the largest negative value in the new list
• >> Print the result in pounds and pence

So, for example, for this step, if the input is the list:

• [-1050, -1345, -1272, -9081]

then the output -90.81 would be printed.

i.Identify which of the TM112 pattern (or patterns) could best be applied to the solution of the second task. State clearly the name of the pattern and the pattern number, for example 'List generation Pattern 2.2'. A list of all the patterns can be found in Problem solving and Python quick reference.

ii.Write an algorithm based on the pattern you have identified. You can assume that the new list exists.

iii.Implement your algorithm as Python code. This must match the steps of your algorithm and you should use comments in the code to make it clear how the two correspond. Marks will be lost if the program does not follow the algorithm.