Language is Java

(20 points) Consider the language given as defined in chapter 7 which describes a recognition algorithm for the language L= {w$w': w is a possibly empty string of characters other than $, w=reverse(w) } a) Write a recognition algorithm for this language that uses both a queue and a stack. Therefore, 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 $. b) Implement your approach c) Write a client class to prompt the user for a string, then use the methods in your class to determine and display a message indicating whether that string is in the language or not