For simplification, create a single class that consists of a main method and three additional methods for each of the below bullet points.

Recursive Fibonacci Sequence:

Write a recursive function fibonacci to generate the $n-$th term in the Fibonacci sequence. Test your function for $n=6.$ Include a detailed explanation of how the function generates the Fibonacci sequence up to the $6$th term.

Recursive String Reversal:

Implement a recursive function reverseString to reverse a given string. Test your function with the string "recursive". Provide a stepby$-$step explanation of how the function reverses the given string.