Java language

50 pts Question 1 Select from multiple dropdowns. Examine the following pseudocode. Each line is numbered (leftmost number). The objective of this exercise is to determine the time complexity of this algorithm that takes as input an nxn matrix M and initialize it. We assume that the first line starts at i=1 and the first column starts at j =1. [Select] First, this algorithm has a bug on line # Answer all the next questions assuming that the bug is corrected. Line # 2 performs [ Select] additions during comparisons and [Select] the full execution of this algorithm. The assignment statement "M.. = 0.0" will be executed [ Select] times. In total, the inner loop will perform [ Select ] comparisons. This total number of comparisons of this algorithm [Select ] This total number of comparisons, additions and grows as [Select] assignment (M...=0.0) of this algorithm grows as InitializeMatrix(M) 1: //Initialize Matrix to 0.0 for each element 2: for j = 1 ton for i = 1 to n-1 3: M[i][j] = 0.0 4: return 5