5.2. Week 3 practical tasks 5.2.1. Exercise 1 Using the flowchart from Week 1 that you designed for sorting cards, implement the logic described in Python. You may need to modify the logic slightly to work with data in memory. The deck of cards is represented in code as follows: deck = [ 5, 7, 1, 9, 2, 8, 12, 11, 4, 3, 10, 6 ] Your goal is to write your own code (without using in-built functions to sort or determine the largest or smallest number (i.e. no sort(), min() or max()) to sort the deck in descending or ascending order