For E = {a, b}, find regular expressions for the complement of the language L = L(aa'bb*).

applied disreet maths  if |A| = n and f:  A--->B is injective, what is |f(A)|?

Please give me correct solution in type Solution only.

Question 1: Find all the strings and a regular expression for L = {VwV: V, wE {a, b)*, |V|= 2}. Question 2: Find a regular expression for L= {wE {0, 1)* : w has exactly one pair of consecutive zeros}