Questions: 1. Write a recursive function string Reverse that takes a character array as an argument, prints it back to front and returns nothing. The function should stop processing and return when the terminating null character of the string is encountered. Example output: Print this string backward. drawkcab gnirts siht tnirp Press any key to continue . . . 2. Write a recursive function power( base, exponent) that when invoked returns baseexponent For example, power( 3,4)=3*3*3*3. Assume that exponent is an integer greater than or equal to 1. Hint: The recursion step would use the relationship baseexponent = base * base exponent-1 and the terminating condition occurs when exponent is equal to 1 because basel = base 3. Write a program that simulates coin tossing. For each toss of the coin the program should print Heads or Tails. Let the program toss the coin 100 times, and count the number of times each side of the coin appears. Print the results. The program should call a separate function flip that takes no arguments and returns 0 for tails and 1 for heads. [Note: If the program realistically simulates the coin tossing, then each side of the coin should appear approximately half the time for a total of approximately 50 heads and 50 tails.]