Just do Question 6

Time Complexity and BigOH .

Question 5 (0 points): (Optional) Consider the following pseudocode: Algorithm roundRobinTournament (a) This algorithm generates the list of matches that must be played in a round -robin pirate -dueling tournament (a tournament where each pirate duels each other pirate exactly once). a is an array of strings containing names of pirates in the tournament n a.length for i- 0 to n-1 for ji+1 to n-1 print a[i]+ "duels" a[j]+ ", Yarrr!'" (a) (6 points) Use the statement counting approach to determine the exact number of statements that are executed by this pseudocode as a function of n. Show all of your calculations (b) (1 point) Express the answer you obtained in part a) in big-O notation Question 6 (3 points): Using the active operation approach, determine the time complexity of the pseudocode in question 5. Show all your work and express your final answer in Big-O notation