Question 18 1 Point The following NPDA accepts the language L = {w {a,b}":2n5(W) sna(w) s 3nb(W)} , a; q2 93 a, a, aa a, Z; az b, a; 1, a; 1 ^,a ,a; a ,Z;Z. ,,Z;Z 90 q1 94 A True B False Question 19 1 Point The class NP-Complete is a subset of the class NP and SAT was shown to be in the NP-Complete class. A True B False