Write a recursive C++ function "accept" that takes a string and returns true if and only if it follows the a"Xb" pattern. You can use the following main function to test "accept": int main(){ string...

Write a C++ function "accept" that takes a string and returns true if and only if it follows the ? pattern. use stacks to build the function

> input; while (input!="abort!"){ if (accept(input)) cout < "follows="" the="" pattern.in";="" else="" cout="">< "does="" not="" follow="" the="" pattern.\n";="" cout="">< "input="" string:="" \n";="" cin="">> input; } "/>
Extracted text: Write a recursive C++ function "accept" that takes a string and returns true if and only if it follows the a"Xb" pattern. You can use the following main function to test "accept": int main(){ string input; cout < "write="" the="" string="" you="" want="" me="" to="" check.="" if="" you="" want="" to="" abort,="" type="" \"abort!\"="" \n";="" cin="">> input; while (input!="abort!"){ if (accept(input)) cout < "follows="" the="" pattern.in";="" else="" cout="">< "does="" not="" follow="" the="" pattern.\n";="" cout="">< "input="" string:="" \n";="" cin="">> input; }