Answer : Option A
language $L1$ : $L1$ is not Regular, Not even DCFL.. Why?
In $L1$, All strings are of even length And We are required to find the Middle of the String..because In the First half part we can't have $c$ and in the next half part we can't have $a$. But Finite automaton do not have the power to find the Middle.
language $L2$ : $L2$ is regular.
language $L3$ : $L3$ is CSL.
language $L4$ : $L4$ is Non-regular because there could come(occur) any number of $ac$ without any $abc$ occurrence. And So, After that we would need to remember how many $ac$ have occurred etc. Such things are not possible for $FA$ So, Non-regular.