2, Towers of Hanoi Problem. (10 points) The Towers of Hanoi is a famous problem for studying recursion in computer science and searching in artificial intelligence. We start with N discs of varying sizes on a peg (stacked in order according to size), and two empty pegs. We are allowed to move a disc from one peg to another, but we are never allowed to move a larger disc on top of a smaller disc. The goal is to move all the discs to the rightmost peg (see figure). To solve the problem by using search methods, we need first formulate the problem. Supposing there are K pegs and N disk. Answer the following questions. (1) Determine a state representation for this problem. (4points) (2) What is the size of the state space? (3 points) (3) Supposing K=3, N=4, what is the start state by using your proposed state representation method and what is the goal state? (3 points)

NOTE: (what your answer will contain)1. Use C PROGRAMMING LANGUAGE ONLY2. Use RECURSION type of program3. Copy and paste your code(no need screenshot)4. Screenshot the output5. It should be USER-DEPENDENT

(a) State the two common programming errors that cause a recursive function to call itself endlessly.

Please help me with this one. Just choose the letter with the correct answer. Thank you very much in advance :)

4. The Fibonacci series: 0, 1, 1, 2,3,5,8,13,21... begins with terms 0 and 1 and has the property that each succeeding term is the sum of the two previous terms. Write a program containing a recursive function that computes and displays the nh Fibonacci number, given the value for n.

QUESTION 9 There are several rules to keep in mind when writing a recursive function. Select all of them from the following list. A. The recursive function may not call any other function or method. B. The value of all arguments passed to the recursive tunction must change for every recursive cal. C. The recursive method must cali the main function in order to begin. D. There must be a clearly stated base case. E. The function must contain a break statement to end the recursion. OF. The recursive function may not include a return statement. G. Recursive calls to the function must converge on the base case. H. One or more arguments passed to the function must change in value each time the function is cailed.

6. Write a recursive function that find the sum of the following series. 1+1/2+1/4+1/8+...+1/2"

QUESTION 9 There are several rules to keep in mind when writing a recursive function. Select all of them from the following list. of al Tust A. The recursive function may not call any other function or method. B. The value of all arguments passed to the recursive function must change for every recursive call. C. The recursive method must cal the main function in order to begin. D.There must be a clearly stated base case. CE. The function must contain a break statement to end the recursion. OF. The recursive function may not include a return statement. G. Recursive calls to the function must converge on the base case. is called. H.One or more arguments passed to the function must change in value each time the function i

(sigma)={ a , b }, the length of the strings in language L is at least two, the first two symbols are combined with the last two is the same. For example; aa, bbb, aaaa, bbabb, ababab, … Draw the diagram of the DFA of language L.