The first two elements of the Fibonacci sequence are 0 then 1. The value of every following element is the sum of the preceding two elements. For example, let Fib(n) represent the n^th element of the Fibonacci sequence so Fib(0) = 0, Fib(1) = 1, Fib(2) = 1, Fib(3) = 2, etc. Here is a table with a few more values:

n:	0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	...
Fib(n):	0	1	1	2	3	5	8	13	21	34	55	89	144	233	377	610	987

Write a program in MIPS that contains a procedure which takes one argument - an integer greater than or equal to zero which specifies which element of the Fibonacci sequence is to be returned. The procedure must be recursive and return the correct Fibonacci value. Also, include a "main" section with at least one call to that function.