Most parsers have problems with left recursion $$ that is$,$ a production rule of the from $,$ where X in $()$ as we have seen in class, this can lead to infinite loops. Indeed, one of the steps in converting a grammar to Greibach Normal Form is to eliminate all left recursion from the grammar. Consider a variable $$ with these productions: $11||0|11|00.$ Develop a way to rewrite these productions $($possibly involving creating other auxiliary variable$($s$))$ so that $$ no longer has any left recursion