Question $2$

$2$ pts

Indicate whether the language below is regular, context$-$free but not regular, or not context$-$free.

All strings of $0$ s and $1$ s in which each maximal substring of $0$ s has length divisible by $3$ and each maximal substring of $1$ s has length divisible by $5.$

regular

context$-$free but not regular

not context$-$free