Instructions:

Write a java code to compute the last digit of the $n^{th}$ Fibonacci number.

Must use recursive implementation only

Must include comments and implementation details

Input: An integer $n.$

Output: The last digit of the nth Fibonacci number.

Examples:

Example $1$: input $=3,$ output $=2$

Example $2$: input $=139,$ output $=1$

Example $3$: input $=10,$ output $=5$

Sample code below displays$/$prints $n$th Fibonacci number recursively. Using the below code,

implement a logic to compute the last digit of the e $n^{th}$ Fibonacci number recursively.

import javautit Scanner;

public class Fibonacci $\{$

public static void main$($String$[]$ angs$)\{$

Scanner sc $=$ new Scanner$($

System.in$)$;

System out priat $("$Enter an integer n: $")$;

int $n=$ scinextInt $()$;

System out Rrintln$("$The nth Fibonacci number is: $"+$ fib$($n$))$;

$\}$

$//$ Recursive function to calculate the nth Fibonacci number

public static int

if $)\{$

return $n$;

$\}$

$//$Recursively

return fib$($n$-1)+$ fib$($n$-2)$;

$\}$

$\}$