Construct a regular expression for the below expression, if it cannot be consturcted explain why.: Given an alphabet $\backslash$Sigma $=\{$a$,$ b$,$ c$\},$ construct a regular expression that matches strings where

the count of b$$s is precisely twice the count of c$$s and where the count of a$$s is the same as

the count of c$$s $($e$.$g$.,$ babc, cabb, cacbbabb, etc.