L= {w $ w' : w is a possibly empty string of characters other than $, w' = reverse (w) }. 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 w into a queue and each character of w' into a stack. Assume that each input string contains exactly one $.