Embed the function in a program and test it. After you have fully debugged this function, define another function named reverseCstring that takes a single argument that is a C string and modifies the argument so that it is reversed. This function will include a call to the recursive definition you did for the first part of this project, and need not be recursive. Embed this second function in a program and test it. Turn in only this final result (with output, of course).

Write a recursive method to reverse a string. Explain why you would not normally use recursion to solve this problem.

Rohan is playing a game in his class in which he takes heights of two persons and then find the greatest common divisor of those heights. You have to help rohan by writing c code using recursion

A lecturer intends to separate his students into 2 groups based in their index numbers those with odd numbers in group A and Even numbers in B.Use if-else staement to implement this.

Fibonacci numbers are a sequence of integers, starting with 1, where the value of each number is the sum of the two previous numbers, e.g. 1, 1, 2, 3, 5, 8, etc. Write a function called fibonacci that takes a parameter, n, which contains an integer value, and have it return the nth Fibonacci number. (There are two ways to do this: one with recursion, and one without.)

Let n be a positive integer and let MaxCrossing(n) be a function that returns the maximum number of line crossings that you can create by drawing n straight lines.  Write down a recursive formula for MaxCrossing(n) and analyze the time complexity of the corresponding recursive algorithm.  You must write a formal recursive formula including the base case and general recursive step.   Note: if n=1, there is 0 crossing, if n = 2, there is 1 crossing, if n = 3, there are 3 crossings (not only 2) if n = 4, there are 6 crossings (not only 3) if n = 5, there are 10 crossings, etc.

Write a recursive method that returns the value of N! (N factorial) using the definition given in this chapter. Explain why you would not normally use recursion to solve this problem.

Write me a program in MATBLAB using the Two-Phase Method in Linear Programming. You may use the code for Simplex Method.

Write a recursive implementation of Euclid’s algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books and on the Web. Write a test program that calls your GCD procedure five times, using the following pairs of integers: (5,20), (24,18), (11,7), (432,226), (26,13). After each procedure call, display the GCD.