Given the alphabet ∑={0,1,2,3,4,5,6,7,8,9}, define the followingtwo languages over ∑*: L1 = x is divisible by 5 and L2 = x is notdivisible by 5. Elements of L1 and L2 are represented in base tenwithout leading 0s, except for zero which is simply the singledigit 0. a) Write a regular expression denoting L1. b) Write aregular expression denoting L2.
Answer
Io, s, to, s, 20,2 30, 3S,~- 2,3,u,6, 7 8,, 11,- me ‘Cor@213|v1<“미 819)(015) Rela exprervion denoting Co)