Correct Option: B

Language is not regular bcoz we need to match count of c's is equal to count of b's + count of a's and that can implement by PDA
∂(q₀ , a ,^) = (q₀ , a) [push a in stack, as per language a comes first]
∂(q₀ , a , a) = (q₀ , aa) [push all a's into stack]
∂(q₀ , b , a) = (q₁ , ba) [push b in stack, state change to q₁ that sure b comes after a]
∂(q₁ , b , b) = (q₁ , bb) [push all b's in stack]
∂(q₁ , c , b) = (q₂ , ^) [pop one b for one c]
∂(q₂ , c , b) = (q₂ , c) [pop one b's for each c and continue same]
∂(q₂ , c , a) = (q₃ , ^) [pop one a for one c, when there is no more b in stack]
∂(q₃ , c , a) = (q₃ , ^) [pop one a for each c and continue same]
∂(q₃ , ^ , ^) = (q_f , ^) [if sum of c's is sum of a's and b's then stack will be empty when there is no c in input]
Hence, language is context- free but not regular.