First statement is wrong because it is also have a string "aaaaa" which is not divisible by 2 or 3 .
Second is right because we can make PDA for given language so this is CFL .
For making PDA we first push all m 0's and pop with n 1's after that in stack m-n 0's remains.
After we pop the 0's from stack and make a mod loop (like dfa ) so we can check remain 0's are even or odd.