Important note: you do not need to get a working program in part a. in order to attempt part b. A student wants to design and implement a Python program to convert any 6-bit unsigned binary number to its decimal equivalent. There are many ways of doing this, but here is their initial top-level decomposition: > Convert binary to decimal > Input a list of six 1 s and 0 s corresponding to the binary number to be converted > Input a list of six column weightings consisting of powers of two > Create a new list that contains the decimal values of each binary digit of 1 in the input list > Add up the decimal values in the new list and print result decomposition given at the beginning of this question: Add up the decimal values in the new list and print result So, for example, for this step, if the input is the list: [16,4,2] The output 22 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 the Problem solving_and Python quick reference ii. Write an algorithm based on the pattern you have identified 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. Your code should include a comment that gives your PI number. Copy your Python code, as text, for this second task into your Solution document. Name your Python file Q2b_OUCU.py, where 'OUCU' is your OU computer username, e.g. abc123. Then include the code file in your TMA.zip file