Write a regular expression for the following language: The set of all binary strings whose number of 1's is divisible by five. E.g., 0111110, 01101110 and 11001101101110010 are accepted but 00000111, 00110011011, 0000011100000 are not.