[Solved]-Question 1 1 Point Suppose Want Print Grid Numbers Using Code Int R 0 R Q37183961

media%2F6a5%2F6a517b17-722e-4f7f-8b59-ef Question 1 (1 point) Suppose you want to print an grid of numbers using the code below: for (int r-0; r<5; r++) for (int c 0; c<4: c++) System.out.print(r+c)”); System.out.println0; How many columns will the grid have? Your Answer Answer We were unable to transcribe this imageQuestion 3 (1 point) The public keyword in the signature of a static method means that everyone can change the implementation. True False Question 4 (1 point) When creating a class, where should the instance variables be placed? Inside the curly braces for the class, but outside any method. Inside the first method that they are used in Outside the class Activate Inside the main method. Question 5 (1 point) A do-while loop always executes at least one iteration of the loop. True False Question 6 (1 point) When curve fitting a form aNb using a log-log plot, the slope of a fitted line corresponds to the coefficient b True False Question 9 (1 point) In comparison to other sciences, experimentation in computer science is virtually free. True False Question 12 (1 point) Mergesort has n2 order of growth for run time for array size n. True False Question 13 (1 point) Insertion sort finds the smallest value in the unsorted range, removes it, and places it at the end of the sorted range. True False Question 14 (1 point) The base case in the recursive implementation of mergesort is when the subarray length is O or 1, the subarray is all ready sorted. Activ True False Question 15 (1 point) Given the following table of timing results for problem size N and run time TN and the assumption that TN-aNb, what is the estimate for b? 4 8 16 31 258 65123 2 3 none of the above Activa Question 11 (1 point) Given the following table of timing results for problem size N and run time TN and the assumption that TN aN, what is the estimate for b? TN 0.5 4 31 248 1000 2000 4000 8000 2 Activat non of the above Question 10 (1 point) What is the order of growth with respect to parameter n for the following function? public static int m(int n, int[] a) int count e; for(int i-0; i< n; ++i) count++ for( int ¡f 0; j< ++j){ n; 2){ on 9 Unsaved! (a[j] count++ > return count; n log n ActivateVW 2 Question 7 (1 point) Given the following table of timing results for problem size N and run time Ty and the assumption that TN-aNb, what is the estimate for b? IN 0.01 0.05 0.21 0.79 4000 8000 16000 32000 2 3 Activate W none of the above Question 8 (1 point) What is the order of growth with respect to parameter n for the following function? public static int bar(int n, intt] a) int count 0; for(int i-0; i< ++1){ n; count+j 11 12 return count; 14 15 log n n count Activate Wind Go to Settings to a Show transcribed image text Question 1 (1 point) Suppose you want to print an grid of numbers using the code below: for (int r-0; r