Consider the languages.$($a$)\{02$n$1$n $|$ n $>0\}($b$)\{05$n$1$n $|$ n $>0\}($c$)\{$w $|$ w a string of $0\text{'}$s and $1\text{'}$s such that when interpreted in reverse as a binary integer it is a multiple of $5\}($d$)\{0$n$1$n$|$n$>0\}($e$)\{$w $|$ w a string of $0\text{'}$s and $1\text{'}$s such that its length is a perfect square$\}($f$)\{$w $|$ w string of $0\text{'}$s and $1\text{'}$s such that when interpreted as a binary integer it is not a multiple of $5\}($g$)\{$w $|$ w a string of $0\text{'}$s and $1\text{'}$s such that its length is not a perfect cube$\}($h$)\{$w $|$ w a string of $0\text{'}$s and $1\text{'}$s such that the number of $0\text{'}$s is not equal to twice the number of $1\text{'}$s$\}$Identify the regular language$($s$)$

Group of answer choices

$($c$)$

$($f$)$

$($g$)$

$($a$)$

$($d$)$

$($b$)$

$($h$)$

$($e$)$