Use stacks to evaluate if a given string is in a language L. Your code will not be recursive. In your analysis, suggest a recursive algorithm and compare with your stack based solution. The purpose of using a stack is to take advantage of its LIFO nature, therefore algorithms which merely use the stack for storage and determine inclusion of the string in the language by the use of countingthe input string in any manner will NOT receive any credit. Let L1= { w: w contains equal numbers of A's and B's (in any order) and no other characters}L2 = { w: w is of the form AnBn, for some n > 0 }L3 = { w: w is of the form AnB2n, for some n > 0 }L4 = { w: w is of the form (AnBm)p, for some m, n,p > 0 }L5 = { a non-trivial language of your choice}Examples of languages which are only trivially different from L1 and L2:L5 = { w: w contains equal numbers of C's and D's (in any order) and no other characters},L5 = { w: w is of the form CnDn for some n > 0 },L5 = { w: w is of the form BnAn for some n > 0 }.w = AAABBBAB? ( the empty string) each string given as well as additional strings you make up yourself against each of the fivelanguages. A sixth language would be considered an enhancement. Be sure to discuss your data structures and their implementation and why they make sense. E. g.why is stack a reasonable choice to solve this problem? What implementation of a stack did youchoose? Why? As stated above, consider a recursive solution and compare it to your iterativesolution. Is one better than the other? If so, why?