Need help with this program C++ (Data structures and Algorithms).

------------------------------------------------------------------------------------

Requirements (criteria program must pass):

Using of recursion to solve the problem

Solid base case for the recursive solution

Using a Recursive case

Good strong test cases to test both true and false situations

The program works correctly and passes all test cases

------------------------------------------------------------------------------------

Instructions:

-------------------------------------------------------------------

SubsequencesTester.cpp file:

#include #include "Subsequences.h"

using namespace std;

void verifyCase(string, string, string, bool);

int main() { /** Add several more test cases to thoroughly test your data verifyCase takes the following parameters (name, word, possible subsequence, true/false it would be a subsequence) **/

verifyCase("Case 1: First Letter", "pin", "programming", true); verifyCase ("Case 2: Skipping Letters", "ace", "abcde", true); verifyCase ("Case 3: Out of order", "bad", "abcde", false);

return 0; }

void verifyCase (string testCaseName, string sub, string sentence, bool correctResponse){ Subsequences s(sentence); if(s.isSubsequence(sub) == correctResponse){ cout