please use JFLAP and provide screenshots or something so i can understand

5.12 Suppose M is a standard (single-tape) Turing machine using the five-symbol alphabet ={a,b,c,d,e}. Give a high-level description of how to simulate M using a standard (single-tape) Turing machine M that employs the four-symbol alphabet ={a,b,c,d}. Your simulation need only work correctly for input and output strings that contain no "e" characters. More precisely, M must have the property that if I and M(I), then M(I)=M(I). Complete exercise 5.12 on p100 of the text. Criteria for Success: You need a clear explanation ou how a TM with an alphabet of four characters can simulate a TM with an alphabet of five characters. Notice that we are assuming that the input and output only use the four characters but the computation on the inputs may use all five characters. Hint: You need to figure out how the characters in the 5 -symbol alphabet could be "coded-up" with a 4-symbol alphabet