Please give clear explanation with steps and diagrams for all parts of the question

1. Consider the language L defined by the DFA M given below: Because L is regular and M has 5 states, the pumping lemma applies with pumping length 5. (a) The string 0101011 has length longer than 5 and is accepted by M, so the pumping lemma says it can be partitioned into three parts xyz subject to the constraints of the lemma. For this problem, I'd like you to tell me how the pumping lemma would partition the string 0101011. In other words, tell me what x,y, and z the pumping lemma gives for this string. (b) The pumping lemma says you can pump this string up as many times as you want and the resulting string will still be in the language L. If you pumped the string 0101011 up once (that means i=2 ), what string will you get? (c) The pumping lemma also says you can pump this string down and the resulting string will still be in the language L. If you pumped the string 0101011 down (that means i=2 ), what string will you get? (d) How would the pumping lemma partition the string 01100 ? (e) How would the pumping lemma partition the string 10100? (f) How would the pumping lemma partition the string 10110