please help question 5&6

A1gorithm roundRobinTournament (a) This algorithm generates the 1 ist of matches that must be played in a round-robin pirate-dueling tournament (a tournament where each pirate duels each other pirate exactiy once). a is an array of strings containing names of pirater in the tournament I=alength for i=0 to n1 for j=i+1 to n1 printa[i]+nduelsn+a[j]+n,Yarrrl" Note: the pseudocode for 1 = a to b means that the loop runs for all values of i between a and b, inclusive, that is, including the values a and b. (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- notation (since, again, the best and worst cases are the same). 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