Use JAVA to design and implement a recursive descent parser for the following simple arithmetic expression:

-> {(+ | -) }

-> {(* | /) }

-> id | int_constant | ()

Note: you also need to implement the lexical analyzer named lex and an error-handling subprogram named error.

Also provide sample input and output

Sample input: (sum * (count - 5)) / average EOF.