Consider the function MySort(list), where list contains a list of values. Note the following: o In line 01, len produces the number of elements in the list o The for loop in line 03 first assigns the value 0 to ix. When execution returns to line 03 the value irn ix is incremented and compared to the value nn - 1. If the value in ix smaller, the loop continues. Line 05 is used to swap the contents of list[ix] and list[ix+1] a) Draw a flowchart for the given function. b) Write an execution history, filling in value for ten lines of the execution history. Each line in the o execution history lists values before the corresponding line executes. line list 1X [5, 2, 6] def MySort (list): while nn ? 0: #00 #01 #02 nn len(list) = #03 #04 # 05 #06 for ix in range (0,nn-1): if list [ix ? list [ix+1]; list [ix] , list [IX+1] -list [ix+1],list [IX] #07 #08 return list # end of MySort() Consider the function MySort(list), where list contains a list of values. Note the following: o In line 01, len produces the number of elements in the list o The for loop in line 03 first assigns the value 0 to ix. When execution returns to line 03 the value irn ix is incremented and compared to the value nn - 1. If the value in ix smaller, the loop continues. Line 05 is used to swap the contents of list[ix] and list[ix+1] a) Draw a flowchart for the given function. b) Write an execution history, filling in value for ten lines of the execution history. Each line in the o execution history lists values before the corresponding line executes. line list 1X [5, 2, 6] def MySort (list): while nn ? 0: #00 #01 #02 nn len(list) = #03 #04 # 05 #06 for ix in range (0,nn-1): if list [ix ? list [ix+1]; list [ix] , list [IX+1] -list [ix+1],list [IX] #07 #08 return list # end of MySort()