Consider the language L over the alphabet = {a, b} given by the following regular expression: baba. Show a specific number p > 0 that could be provided by the Pumping Lemma for the language L. Prove explicitly that this p is indeed good by showing clearly how to split every word w L of length at least p into xyz such that |xy| p, |y| > 0, and xy^kz L for every k 0.