Write a java program to print the number from 1 to 100 without using loop, recursion, bitset.Think about arrays and do this with array in O(1) time complexity

convert the recursion code to alterative code in java  public int array11(int[] nums, int index) {        if (index == nums.length)            return 0;        if (nums[index] == 11)            return 1 + array11(nums, index + 1);        return array11(nums, index + 1);  }

Implement a function in Java to find the largest and smallest elements in an array of integers, and return them in a pair. The function should have a time complexity of O(n) and a space complexity of O(1).

Write a java code for the following . Write a Java program to print the unique elements along with their frequency in the given (3x 3) integer matrix.                                 ex. java sample output

Using recursion, write a Java program that takes an input ‘n’ (a number) from a user to calculate and print out the Fibonacci using the following modified definition:   F(N) = 1                                                    if n = 1 or n = 2         = F((n+1)/2)2 + F((n-1/2)2           if n is odd         = F(n/2 + 1)2 – F(n/2 – 1)2         if n is even                                     Your solution must implement recursion to receive points for this question.

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