In java,
14. Code a recursive solution for Exercise 11(d), and provide a driver program to test your solution.
11(d) The sum of the integers from a to b , a> b .
15. Code a recursive solution for Exercise 11(e), and provide a driver program to test your solution. 11. e) Outputting an array of characters, c, given the starting and ending indices.
16. Code a recursive solution for Exercise 11(f), and provide a driver program to test your solution. 11. f) Binary search of an array to locate the value aKey.
17. Code a recursive solution for Exercise 11(c), and provide a driver program to test your solution. 11. c) The product of two integers a and b.
20. Code a program that outputs the first 45 terms in the Fibonacci sequence by invoking a non-dynamic recursive method that calculates the n th term of the series.
- One project report in the form of PDF
- One separate zip folder which contains all the source codes (java preferred.)
Report: In the project report, please illustrate clearly what is your project about, the functions of source files, and the testing results.
Code: Check whether all operations have been successfully implemented. Check whether the code is commented appropriately and structured well.
0 comments