1. The operation changeleft replaces the leftmost symbol of any string by all other possible symbols, that is, for all a changeleft(aw)={bw:b{a}}. Extending this to languages, we define changeleft(L)=wLchangeleft(w). (a) Let L be the language accepted by the finite automaton on Jexercise4.1. Construct a finite automaton for changeleft (L). Assume that ={a,b,c}