Theory algorithms question:

All questions in this homework use the alphabet = {a, b}.

Here is question 1 for part e as reference:

Question 4. Define L -(a, ba). a. List the elements of Lo b. List the elements of L c. List the elements of L d. List the elements of L e. What is the relationship between L" and the language Li from Question 1? All questions in this homework use the alphabet = {a,b). Question 1. Define Li-(w e * : w does not contain two consecutive b's) a. How many strings in L1 have length 0? b. How many strings in Li have length 1 c. How many strings in Li have length 2? d. How many strings in L1 have length 3? e. How many strings in Li have length 4