# Construct NPDA for the language

$$L=\{w \mid w \in \{a,b\}^*$$, $$\text{the number of a's is at least the number of b's} \}$$

I'm stuck trying to build an NPDA that accepts $$L$$.