Build an NPDA that accepts the following languages on = {a, b, c} without converting to the grammar, use the algorithmic equations L =

Build an NPDA that accepts the following languages on Σ = {a, b, c} without converting to the grammar, use the algorithmic equations

L = {w ∈ {a,b}*: n_a(w) = n_b(w) and

n_a(v) ≥ n_b(v) for any prefix v of w}

              eg.   (()(()))