Page 3 Question 8 0: 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 entrants into a tournament n a.length for i = 0 to n-1 for j i+1 to n-1 print a[i]duels "al] ", Yarrr!" (a) (5 points) Determine the exact number of statements (i.e. use the statement counting approach that are executed by the above algorithm. Express your answer as a function of n. Show all your calculations (b) (1 point) Express the function you obtained in part a) in big-O notation