Write regular expressions for the following languages$:$
1. The set of all strings of $0's$ and $1's$ such that every pair of adjacent $0's$ appears before any pair of adjacent $1's.$
2. The set of strings of $0's$ and $1's$ whose number of $0's$ is divisible by five.