SUBJECT Data Structures and Algorithms

Q1. Sorting and Trees [CLO1] [15 Marks] a. Write ASCII Codes of first 14 characters of your name without name space. Each letter in one box and consider all characters as upper case (ASCII code for A= 65 and Z=90). If your name is less than 14 characters then consider remaining as zeros. : [2 marks] - Write your answer in the table 0 1 2 3 4 5 6 7 8 9 11 13 10 12 b. Perform first five iterations of the following sorting algorithm on the above numbers. [5 Marks] def Sort(A): for i in range(len(A)): idx = 1 forj in range(i+1, len(A)): if A[idx]