Implement a recursive function to find the i$\_($i$^("$th $"))$ term of a Fibonacci series. The Series $01123581321345589$ dots. Indices $01234567891011$ The Fibonacci series begins with $0$ and $1.$ And each subsequent number is the sum of the preceding two. The series can be recursively defined as: Sample Output: fib$\_\_(0)=0$; run: Please insert a positive integer number fib$\_(1)\_=1$; $9$ Fibonacci number for index $9$ is $34$ fib$($index $)="$ fib $"\_($ index $-2)+$ fib$($index $-1)$; index $>=2$; BUILD SUCCESSFUL $($total time: $1$ second$)$ Implement a recursive function to find the $i_{th}^{th}$ term of a Fibonacci series.

The Fibonacci series begins with $0$ and $1.$ And each subsequent number is the sum of the

preceding two. The series can be recursively defined as:

Sample Output:

$fi{b}_0{?}_{?}=0$;

run:

Please insert a positive integer number

fib ${?}_{(}()1{)}_{?}=1$;

$9$

Fibonacci number for index $9$ is $34$

BUILD SUCCESSFUL $($total time: $1$ second$)$

fib index