Construct regular expressions for the following languages over alphabet

$\{0,1\}$:

$($a$)$ The set of all strings whose fifth symbol from right is $0.$

$($b$)$ The set of all strings having either $000$ or $111$ as a substring.

$($c$)$ The set of all strings having neither $000$ nor $111$ as a substring.

$($d$)$ The set of all strings having no substring $010.$

$($e$)$ The set of all strings having an odd number of $0$s$.$