Consider the language

L = { s$s' : s is a possibly empty string of characters other than $ , s' = reverse( s )}
As defined in Chapter 6 . Write a recognition algorithm for this language that uses both a queue and a stack. Thus, as you traverse the input string, you insert each character of s into a queue and each character of s' into a stack. Assume that each input string contains exactly one $.