Give an algorithm (described informally) that takes as input an NPDA A and determines whether the language of A is nonempty.You should argue for the correctness of your algorithm, but you do not need to give a full formal proof of correctness.