1. Given the following function: int Fn (int N) { } if (N == 0) return 2; else return N + Fn (N/3); a) What type of function is this, Iterative or Recursive? Give justification. b) Given N = 17, what will be the output from this function? Show your work.

[In C language] The concept of a "drunkard's walk" involves an individual who starts walking aimlessly from a lamp post. With each step they take, they move randomly either north, south, east, or west, each with a 25% probability. As the individual takes more steps, they tend to forget where they started and continue taking random steps. The objective is to determine how far the individual will be from the starting point (0,0) after taking N number of steps. To simulate this random walking motion for N steps, we can create a computer program. This program should ask the user to input an integer representing the number of steps to be taken. It should work for any positive value of steps, even for a large number. However, if the user enters an invalid number (such as a negative value), the program should display an error message. After each step, the program should show the current location of the random walker with respect to the origin (lamp post). Finally, when the random…

C++ Help

is it correct ? Write a recursive function that returns the nth number in a fibonacci sequence when n is passed to function. The fibonacci sequence is like 0,1,1,2,3,5,8,13...... Answer: #include <iostream>   using namespace std;   int getFibonacci(int n) {         if (n == 0 || n == 1)         return n;         else         return getFibonacci(n - 1) + getFibonacci(n - 2); }   int main() {     int n = 7;     int result = getFibonacci(n);     cout << result; }