Write the algorithm and its corresponding C++ implementation for a value-returning function that receives a string corresponding to a sentence and returns a string with the words reversed and separated by the last punctuation mark found in the original string.

Write a program to test your function with those strings provided in the file input5.txt that accompanies this handout.

To implement your function you must use classes stack and queue from the Standard Template Library (STL).

Your program ( main() ) must read from the file a string, pass it to your value-returning function, and then print the returned string.

The input file may contain several strings finished by a new line character (Enter) each. Words are separated by one or more blanks or punctuation marks (see the functions provided by header file cctype on page 857).

For the algorithm of your function, use pseudocode similar in type to the example shown on page 258 of the textbook for function getStudentData. For the algorithm of your main program use the example on page 257 as your reference.

 

Example:

 

For an input like

 

Therefore, just do it

 

The output should be

 

eroferehT,,tsuj,od,ti,