The Fibonacci numbers are a sequence of integers in which the first two elements are 1, and each following element is the sum of the two preceding elements. The mathematical definition of each kth Fibonacci number is the following: F (k) : k > 2 : F (k-1) + F (k-2) k < = 2 : 1 The first 12 Fibonacci numbers are: 1 1 2 3 5 8 13 21 34 55 89 144 Write a piece of code that uses a for loop to compute and print the first 12 Fibonacci numbers. (You may include other code, such as declaring variables before the loop, if you like.)

The code in Java that computes the Fibonacci sequence is given below:

class Main {

public static void main (String[] args) {

long a = 0;

long b = 1;

long c;

long n = 12;

System. out. print (b+" ");

for (int i = 2; i < = n; i++) {

c = a + b;

a = b;

b = c;

System. out. print (c+" ");

}

}

}

Explanation:

In this section I explain the code:

class Main {

public static void main (String[] args) {

long a = 0; / /Seed value for the serie k-1

long b = 1; / /Seed value for the serie k-2

long c; / /Seed value for the serie k

long n = 12; / / Represent the digits you want of the sequence

System. out. print (b+" "); / /Print the first digit of the sequence k-2

for (int i = 2; i < = n; i++) {

c = a + b; / /Refresh the current value

a = b; / /Update the value of k-1

b = c; / /Update the value of k-2

System. out. print (c+" "); / /Print the current value of the sequence

}

}

}