Question $16$

Max. score: $50\mathrm{.}00$

$C++17(g++10\mathrm{.}3\mathrm{.}0)$

Auto$-$complete ready!

Islands

The map contains islands, named from Island $1$ to Island N$.$ For any

two islands Island I and Island $J(IJ),$ you can go to Island $J$ from

value for the last Island, equal to $N,$ find the number of ways to reach

Island $N$ from the first Island, that is$,$ Island $1.$

Find the number of ways to reach Island $N$ from Island $1.$

Note: Assume $1$ based indexing.

Function description

Complete the solve function. This function takes the following

parameter and returns the required answer:$-$

$N$ : Represents the index of the destination island

Input format for custom testing

Note: Use this input format if you are testing against custom input or

writing code in a language where we don't provide bollerplate code.

The first line contains $T,$ which represents the number of test

cases.