Question 50 Consider the following pseudocode Algorithn roundRobinTournament (a) This algorithm generates the list of matches that sust 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 nanes of pirates in the tournament na.length for i- O to n-1 for j 1+1 to n-1 print ati]uduelsu"atjYarrr! (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-e 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-notation