Implement a function (Java or pseudocode) that will accept a mathematical expression which contains square brackets, curly brackets and normal brackets (i.e. “[ …]”, “{ …}” and “( … )”) as the input and would return whether the expression has matching brackets or not. The input expression will be given as a String array where each element in the array is a bracket (one of “[”, “]”, “{”, “}”, “(”, “)”) number or a mathematical operator. It should return true if expression has matching brackets and false otherwise

Write a program in java using two dimensional arrays. You should prompt the user toenter the number of rows and columns for your matrix. You should then prompt the userto enter values for each element of the matrix. Once the user has provided all the values for matrix, you should print the matrix and transpose of that matrix. A transpose of a matrix converts rows to columns and columns to rows.Example:Output: This program transposes a matrix.Output: Please enter the number of rows:User enters 2Output: Please enter the number of columns:User enters 3Enter value for row[0] column[0]: 9Enter value for row[0] column[1]: 1Enter value for row[0] column[2]: 2Enter value for row[1] column[0]: 72Enter value for row[1] column[1]: 3Enter value for row[1] column[2]: 6The matrix you entered is:9 1 272 3 6The transpose of this matrix has 3 rows and 2 columns and the transpose is:9 721 32 6

An array is positive dominant if it contains strictly more unique positive values than unique negative values. Write a function that returns true if an array is positive dominant. Examples ispositiveDominant([1, 1, 1, 1, -3, -4]) // There is only 1 unique positive value (1). // There are 2 unique negative values (-3, -4). ispositiveDominant([5, 99, 832, -3, -4]) → true ispositiveDominant([5, 0]) → true ispositive Dominant([0, -4, -1]) → false

Consider the following pseudocode. In this pseudocode, the function mystery has three parameters: array A[] is an int array, size represents the number of element of the A[], and value represents an int value.   mystery (A[], size, value)  1.start = 0, end = size – 1, index = -1+1  2. repeat steps 3 to 6 while (start <= end)  3. x = (start + end)/2 + 2  4. if(value == A[x]) a. index = x+1 b. start = x+1  5. else if (value <-A[x]) a. end = x – 1-1.0  6. else a. start = x + 1+1  7. return index    Suppose A[8] = {1,1,3,3,5,5,5,7}. What value the function mystery will return for a function call of mystery (A, 8, 5)? What is the timing complexity of the function mystery?