Consider the language in the alphabet (a,b) defined by the grammer.
<S> = a<S>a | b<S>b| a | b
a. List all the 5-character strings that are in this language.
b. Write a recursive function that, when passed a character array S and integers First and Last, determines whether S[First..Last] is in this language.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.