Implement a method that would return the Fibonacci number both iteratively and recursively.

unsigned long FibonacciIterative(unsigned short n)
{
    if (n <= 0)
        return n;
 
    int temp = 0;
    int priv = 0;
    int curr = 1;
 
    for (int i = 1; i < n; i++)
    {
        temp = priv + curr;
        priv = curr;
        curr = temp;
    }
 
    return curr;
}
 
unsigned long FibonacciRecursive(unsigned short n)
{
    if (n <= 1)
        return n;
 
    return FibonacciRecursive(n - 1) + FibonacciRecursive(n - 2);
}