L1: The relation 0<=m<=n<=10000 is actually finite relation, and the strings would be finite.
Hence, REGULAR.
L2: Set of palindrome strings. They are definitely not regular. They are CFL.
L3: This DFA will be formed by product of two DFAs.
DFA with even number of zeros : 2 states
DFA with even number of ones : 2 states
So total states required would be 2 x 2 = 4.
So DFA is possible, and hence it is a regular language.
So, option D is the right answer.