1. task: Introduction and basics. And again, Peter Puzzle has found a piece of paper with the following code: int FooBar (A, i) { n= len (A); if (i == n-1) return A; for (j= (i + 1); j

Q5. What is the time complexity of following code? int a for (i = 0; ii; j--) { a = a + i + j; } 0; } Q6. What is the time complexity of following code? int i, j, k = 0; for (i = n/2; i <= n; i++) { for (j = 2; j <= n; j = j * 2) { k=k+n/2; } }

1  public static int sum(int x, int y){   2     int z = x +y;   3     return z;   4 }      5 public static void main(String[] args){    6    …    7      sum(a+2, b);    8  …    9 }      write the signature of the method sum: sum(int,int) *Method name/parameter list   list local variables of sum: x, y, and y are local variables of the function.    list the parameters of sum: int x, int y   write the line number where a call to sum occurs 7    list the arguments for the above call   list the return type of sum here ______________

Question 3 Consider the following code: public static boolean[] [] whichOdd (int[] [] arr) { boolean[] [] result = new boolean [arr.length] [arr [0].length]; for (int i = 0; i < arr.length; i++) { for (int j = 0; j < arr[i].length; j++) { result[i][j] = arr[i][j] % 2 != 0; } [ ] Suppose you have written this solution to a problem that asks you to write a method that accepts a 2D array of integers (guaranteed to be rectangular) and returns a 2D array of boolean s where each element is true if its corresponding element in the parameter 2D array is odd, and false otherwise. You've already tried it with the problem's example which uses 2D array: } [ J return result; and after it's passed to your method, it correctly contains: [1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16] O [true, false, true, false], [true, false, true, false], [true, false, true, false], [true, false, true, false] Select an option below that makes a good test candidate to test a different case that shows…

1. When you run the following code, what would happen?public class Question1 {public static void main(String arg[]){int i;int [] A = new int[10];int count = 0;int temp = 10;for (i=0; i < A.length; i++)if (A[i] < temp) count++;System.out.println(count);}}(a) It finds the smallest value and stores it in temp.(b) It finds the largest value and stores it in temp.(c) It counts the number of elements equal to the smallest value in list.(d) It counts the number of elements in list that are less than temp.

I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # #   ## # # #### #     ## ##### ##       ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…

JAVA Language:  Transpose Rotate.  Question:  Modify Transpose.encode() so that it uses a rotation instead of a reversal. That is, a word like “hello” should be encoded as “ohell” with a rotation of one character. (Hint: use a loop to append the letters into a new string)         import java.util.*;            public class TestTranspose {        public static void main(String[] args) {          String plain = "this is the secret message";   // Here's the message           Transpose transpose = new Transpose();          String secret = transpose.encrypt(plain);          System.out.println("\n ********* Transpose Cipher Encryption *********");          System.out.println("PlainText: " + plain);    // Display the results          System.out.println("Encrypted: " + secret);          System.out.println("Decrypted: " + transpose.decrypt(secret));// Decrypt        }      }            abstract class Cipher {        public String encrypt(String s) {          StringBuffer result = new…

int arr[] = {-2, -4, 8, 4, 3, 3, -9};In Java with this given this array, how would this version of Divide and Conqueror be implemented in this case, specifically?