Give an algorithm (described informally) that takes as input an NPDA A and determines whether the language of A is nonempty.