Construct npdas (diagrams) that accept the following languages on = {a,b,c}

(a) L = {aⁿb^m : n m 3n}

(b) L = {w : na(w) = nb(w) + 1}

(c) L = {w : na(w) = 2nb(w)}