First version conatins inefficient code for finding fibonacci numbers

fib.go

package main

import "fmt"

func main() {
	fmt.Println(Fib(3))
}

//Fib inefficent version
func Fib(n int) int {
	if n < 2 {
		return n
	}
	return Fib(n-1) + Fib(n-2)
}