ASSIGNMENT $1$A

Assignment $1$A tests your knowledge of Recursion $($Chapter $18).$

Design a driver class called YourNameAssignment$1$A $($replace YourName with your actual name$)$ with the following exact methods $($exact names, spelling, caps, parameters, returned values, functionality$)$ in this order:

$\backslash$table$[[$Method$,$Description$],[\backslash$table$[[$YourNameMethod$],[($replace$],[$YourName with$],[$your actual name$)]],\backslash$table$[[$A recursive method that finds the number of occurrences of a specific letter in a word $($any case$).],[$The method should receive the character for the Letter and the string with the Word as$],[$parameters and return the number of occurrences of the Letter in Word. For example,$],[$YourNameMethod$(\text{'}$a$\text{'},$ "cat"$)$ is $")$ is $0,],[$YourNameMethod$(\text{'}$a$\text{'},$ "Azalea"$)$ is $3,$ YourNomeMethod$(\text{'}E\text{'},$ "bee"$)$ is $2,$ YourNameMethod $(\text{'}$a$\text{'},],["$CALAMATA$")$ is $4,$ YourNameMethod$(\text{'}$a$\text{'},$ "biotechnologies"$)$ is $0.]]],[\backslash$table$[[$YourNameTable$],[($replace$],[$YourName with$],[$your actual name$)]],]]$