Your submission for this assignment must include your full name and your official nine-digit Carleton University student number as a comment at the top of the source file you submit. For this assignment, you will be submitting three files. One of these files will be a source code file (that must be written using only the Python 3 programming language) and this file must be named: 101289 012893 The second file you will be submitting is a printout of this document, onto which you have written some information. This component of the assignment ensures that you have carefully considered each of the repeating areas in the pattern you have been assigned. You can create create a printout of this document by pressing the "Print" button in the top right corner. Once you have. completed the table on the printout, take a scan or a digital photograph to include with your submission. 012893 The third file you will be submitting is an image of the flowchart you will design before you begin your implementation. You may use an application (such as Microsoft Word or PowerPoint) to create your flowchart, or you may draw it by hand and take a scan or a digital photograph. Create a "zip" file of your source code submission, your completed printout, and this flowchart image. Please ensure that this "zip" file has the filename "". If your submission crashes (i.e., terminates with an error) on execution, imports any library other than "comp1405_f23_special_library_loomwork_simplified", or is not received by the Sunday cutoff deadline, then it will receive a mark of 0. 2893) 2893 289380 For this assignment, you will use some of what you have learned about the nesting of control structures specifically counter- controlled loops and the identification and deconstruction of repeating control structures, in order to design and implement and algorithm to efficiently reproduce a pattern that has been assigned specifically to you. For the purposes of this assignment, an "efficient" implementation will employ nested looping control structures as much as possible in order to minimize any unnecessary. function call repetition. Your submission must employ nested looping control structures wherever justified, so your submission to this assignment will include an exercise to facilitate this. Your assigned pattern is specific to your student number and must be kept strictly confidential. Posting these images online or sharing them with anyone other than the instructors or teaching assistants will be considered academic misconduct. 012893/n10128 10128038 1st What is the width of the "pattern core" of your assigned pattern? Into how many repeating components can your pattern core be divided? 2nd 9389 101289389 1019389 As previously discussed, ensuring that you understand the problem is always the first stage in effective problem solving. This assignment requires that you answer the questions below before beginning work on your algorithm. 101282 101283 289382 10 89389 1289380 Describe (geometrically) each of these repeating components below to the best of your ability: (n.b., You might not need every row provided it depends on how many components comprise your pattern core.) 10 89389 th 10169389 10169389. 101 10169389 1013 1012 5th 101280380 101289389com 1013 Once you have completed the table above (but still before you begin your implementation) you must design your algorithm by creating a flowchart (either by hand or using an application). Once you have completed this flowchart, create your implementation by "mapping the stages of your algorithm into statements in Python. 1012 389 1012389 101289 89 012892 289382 1289389 10129389 101280 89 10169389 1012 389 012893 1289389 101289 89 10128 101280 89 20128937 012893 1289389 289382 10129389 1289389 101280 89 109389 10129389 39389 101239389 012893 1289389 19389 10169389 101 89389 101 289 Don't forget that your final submission will include the completed table above, an image of the flowchart you designed, and your source code implementation written in Python 3. Failure to include any of these elements will result in a significant penalty.

Fig: 1

Fig: 2