Let L_K be the language over {a, b} defined as follows: L_K = {w {a, b} | w contains at least k occurrences of the substring ab}. For example, L_3 is the language of all strings over {a, b} that contain at least 3 occurrences of the substring ab.

2) Let Lk be the language over (a, b} defined as follows: L4-(w E (a,by iw cntains at least k occurrences of the substring ab) For example, Lg is the language of all strings over {a, b} that contain at least occurrences of the substring alb. (a) Draw the state diagram of a finite automaton that accepts L3. (b) Give the 5-tuple (and specify all its elements, including the transition function) that describes your finite automaton from part (a). (e) Give a 5-tuple specifying finite automaton M such that L(M) - Lk