Please do Latex Code for below typing answer. Provide these below answer in Latex code. I will run the code in overleaf. Please provide the code not picture. Do both diagram and everything

Step 7 of 10A If s be a string in the language then s is 1011. If set p = 4, then claim s is pumpable (which it is not, as it is the only string in the language). This should be 5. Hence then the minimum pumping length is 5. Comment Step 10 of 10 A j. Says be a string in the language & According to pumping lemma if divide s in xyz then x be the empty string, y is (8|0|1) and z is empty string. Now & could not be pumped. Hence the minimum pumping length is 1. Comment