If there would have been no upper bound on $n$, then $L$ would be context free. Here there is an upper bound to $n$ and therefore our language here is finite. All finite languages are regular. Also, all regular languages are context free.
Therefore given language is regular and context free. Ans is (C)