Consider the regular expression r=(a+b)(+c)(a+b) over the alphabet ={a,b,c}. How many strings w are there in L(r) whose length |w| is at most 2? Write

Consider the regular expression r=(a+b)∗(λ+c)(a+b)∗ over the alphabet Σ={a,b,c}. How many strings w are there in L(r) whose length |w| is at most 2?

Write your answer as an integer in the space provided below.