//Recursion Lab #include #include #include #include "myrecursion.h" using namespace std; int main() { string s="Indiana Jones"; cout   Data Structures -Lab 8 S. Miller Lab #8 This program tests the concepts of: Queues Recursion See previous bullet Objective: You will create a few recursive functions without the assistance of cmath and even without multiplication (believe it or not, multiplication is not always available) Submission The following file must be submitted: File Format (owercase) Lab6 my recursion header & maybe more my recurs on h Lab6 Implementation (if required) myrecursion.cpp The file labrecursion.cpp is provided as a simple driver to the functions. In testing, I will be adding more tests. Write a recursive method that takes a string as a parameter It returns a string composed of itself, and a mirror image of itself (reversed), seperated by a hyphen complete this function without the aid of a helper function and without the usage of the string classes reverse method. string string Write a recursive method that receives a queue of type T The function pops and OUTPUTS to cout the reversed queue. template  &q) 1 Write a recursive function to RETURN the nth term from the following SERIES 0, 0.5, 1.5 3, 5, 7.5 3 That is the eth term is 0, the 1st term is 0.5. HINT: Only the oth term is required to handle the base case The difference between each term depends on the previous RULE EXCEPTION: You may use multiplication operator on the recursive step for this one double myseries( unsigned long n  Data Structures -Lab 8 S. Miller Lab #8 This program tests the concepts of: Queues Recursion See previous bullet Objective: You will create a few recursive functions without the assistance of cmath and even without multiplication (believe it or not, multiplication is not always available) Submission The following file must be submitted: File Format (owercase) Lab6 my recursion header & maybe more my recurs on h Lab6 Implementation (if required) myrecursion.cpp The file labrecursion.cpp is provided as a simple driver to the functions. In testing, I will be adding more tests. Write a recursive method that takes a string as a parameter It returns a string composed of itself, and a mirror image of itself (reversed), seperated by a hyphen complete this function without the aid of a helper function and without the usage of the string classes reverse method. string string Write a recursive method that receives a queue of type T The function pops and OUTPUTS to cout the reversed queue. template  &q) 1 Write a recursive function to RETURN the nth term from the following SERIES 0, 0.5, 1.5 3, 5, 7.5 3 That is the eth term is 0, the 1st term is 0.5. HINT: Only the oth term is required to handle the base case The difference between each term depends on the previous RULE EXCEPTION: You may use multiplication operator on the recursive step for this one double myseries( unsigned long n