Please code the following in C#:

myFib

Write a C# function using recursion to compute the Fibonacci number of n (where n is a positive integer). Your function should output the calculated result for the n given. You do not need to type check and can assume the value being given is an integer.

Fib(n) = 1 for n = 0 or n = 1

Fib(n) = Fib(n-1) + Fib(n-2) for n > 1

myFib(5);

8

myFib(10);

89

myFib(8);

34

myFib(45);

1836311903

myFib(0);

1