Let A be a language and define ReplaCE(A)={xbyxayA and a,b} to be the set of all strings obtained by replacing a single symbol somewhere in a string in A. The symbol can be replaced with the same symbol, so ARePLACE(A). For instance, if A={0,0120}{0,1,2}, then RePLACE(A)={0,replace0with111,replace0with22,0120, replacefirstsymbolof0120with1replacefirstsymbolof0120with21120,0020,0220,010,0110,0121,0122}. Show that the NFA-decidable languages are closed under REPLACE; in other words, if A is NFAdecidable, then RePLACE(A) is also NFA-decidable. A well-chosen example can help to illustrate the idea, but an example alone is not sufficient for full credit