JAVA    Make a function that will get the value of ln(n!). use Math.log() function in replace to ln()

I just need the method they are asking for Write a recursive function that takes a start index, array of integers, and a target sum. Your goal is to find whether a subset of the array of integers adds up to the target sum. The start index is initially 0.A target sum of 0 is true for any array. Examples: subsetSum(0, {2, 4, 8}, 10) -> true   public boolean subsetSum(int start, int[] nums, int target) {   }

jhfgjgjgj

*JAVA*The transpose of matrix M is a matrix T such that T[i , j] = M[j , i], for all i and j. a.) Write a parallel program using shared variables that computes the transpose of an n*n matrix M. Use P worker processes. For simplicity, assume that n is a multiple of P. b.) Modify your programs to handle the case when n is not a multiple of P.

Use java and correctly indent code.

JAVA: Which is/are correct statement(s) about the Recursion? (Select all that apply) We can use for loop and while loop in recursion. We solve a problem that depends on solving smaller occurrences of the same problem. We have high performance while using recursion rather than iteration. We have high performance while using iteration rather than recursion. Easy to implement the algorithm while using recursion but hard to find the time complexity. Easy to implement the algorithm while using iteration but hard to find the time complexity. Base case is a simple occurrence that cannot be answered directly. Recursive case is a more complex occurrence of the problem that cannot be directly answered, but can instead be described in terms of smaller occurrences of the same problem. We must have exact one base case and one recursive case. We must have at least one base case. We must have at least one recursive case.