L ={ai b ci| i ≥ 0}
Given language has equal number of a in the beginning as the number of c in the end which makes it context free language.
Simultaneously, they are separated by b which makes the language deterministic.
So, the language is DCFL and as DCFL is the subset of recursive languages it is recursive too.
Option (C)