The language accepted by a Pushdown Automaton in which the stack is limited to 10 items is best described as

(a) Context free
(b) Regular
(c) Deterministic Context free
(d) Recursive