$2.13$ points Let L be the language over the alphabet $\{0,1\}$ containing

all strings w such containing at least one $1$ and containing at least two

$0$s before the last $1.$ For example $01010000$ is in the string because

the last $1$ is the $4$th character and there are two $0$s before it $($the $1$st

and $3$rd characters$).$ On the other hand, $0111000$ is not in the string

because there is only one $0$ before the last $1$ in the string.

Create a regular expression describing L$.$