Give the correct output for the recursive code below: public class Fibonacci { public static void main(String] args) { // Recursive code int x= 10; System.out.println ("Fibonacci series from 1 to "+ x + " is " ); for (int i=1; i<=x; ++i) System.out.print (" " + fibonac(i)); System.out.printIn(); } public static int fibonac (int x) { if (k == 0) return 0; if (k == 1) return 1; return fibonac(x-1)+ fibonac(x-2); } Select one: a.Fibonacci series from 1 to 10 is 123 4 5 67 8 9 10 b.Fibonacci series from 1 to 10 is 136 10 15 21 28 36 45 55 C.Fibonacci series from 1 to 10 is 122 33 3 4 44 4 d.Fibonacci series from 1 to 10 is 1123 5 8 13 21 34 55

Provide JAVA source code with proper comments for attached assginment.

Modify the following operations into a recursive procedure. void ditui(int n) { int i; i=n; } while(i>1) print(i--);

please help me with the following 1) make a sierpenski triangle using java and recursion. Make it similar to the code below. And please comment the code 2) Please make the follow code out put on the console. It a t square fractal  import java.awt.image.*;import java.awt.Color;import java.io.*;import javax.imageio.*; public class Main{   static final int DIMENSION = 1000;       static BufferedImage image = new BufferedImage(DIMENSION, DIMENSION, BufferedImage.TYPE_INT_RGB);   static final int WHITE = Color.WHITE.getRGB();   static final int BLACK = Color.BLACK.getRGB();    private static void drawSquare(int x, int y, int side)      {      if (side <= 0)         return;      else      {                  int left = x - side/2;         int top  = y - side/2;         int right = x + side/2;         int bottom = y + side/2;                   for (int i = left; i < right; i++)           for (int j = top; j < bottom; j++)           {              image.setRGB(i, j, BLACK);           }…

Rewrite the following recursive function using a for loop. public class MyMain { public static int myFunct(int a) { if(a 0) return 0; == else return a + my Funct (a-1); } public static void main(String args []) { int k = 10; System.out.println(myFunct(k)); }

Solve in javaFX

Solve in javaFX

Code 16-1   /** This class has a recursive method.  */    public class EndlessRecursion {    public static void message() {    System.out.println("This is a recursive method.");  message();  } }   Code 16.2   /**  This class has a recursive method message,  which displays a message n times.  */   public class Recursive {  public static void messge (int n) {    if (n>0) {    System.out.println (" This is a recursive method.");  message(n-1);  } } }     Task #1 Tracing Recursive Methods 1. Copy the file Recursion.java (see Code Listing 16.1) from the Student Files or as directed by your instructor. 2. Run the program to confirm that the generated answer is correct. Modify the factorial method in the following ways: a. Add these lines above the first if statement: int temp; System.out.println("Method call -- " + "calculating " + "Factorial of: " + n); Copyright © 2019 Pearson Education, Inc., Hoboken NJ b. Remove this line in the recursive section at the end of the method: return…

1. Let product(n,m) be a recursive addition-subtraction method for multiplying two positive integers. Recursive cases for m = 1 and m < 1 make this method. The return value should be n plus a recursive product() call with n and m - 1. Test a Java method.

JAVA  Question 2: For two integers m and n, their GCD (Greatest Common Divisor) can be computed by a recursive method. Write a recursive method gcd(m,n) to find their Greatest Common Divisor. Method body: If m is 0, the method returns n. If n is 0, the method returns m. If neither is 0, the method can recursively calculate the Greatest Common Divisor with two smaller parameters: One is n, the second one is m mod n (or m % n). The recursive method cannot have loops. Note: although there are other approaches to calculate Greatest Common Divisor, please follow the instructions in this question, otherwise you will not get the credit. main method: Prompt and read in two numbers to find the greatest common divisor. Call the gcd method with the two numbers as its argument. Print the result to the monitor.   Example program run: Enter m: 12 Enter n: 28 GCD(12,28) = 4 And here is what I have so far, package CSCI1302;import java.util.*;public class RecursionDemo {    public static void…