Q2: Write a regular expression for the language L1L2. [4 marks] Let ={0,1}. Consider the following pair of languages over . L1={w: the length of w is divisible by three } L2={w : every second letter in w is a 0}