1. In cpts317, we learned that a problem is a language. Such a statement builds a link from 317 to 350. For instance, consider the following problem: Given: a graph G Question is G connected? This problem corresponds to the language that puts all the string encodings of the positive instances of the problem into: G) G is a connected graph), where (G) is a string encoding of graph G Please indi Given: a number n and two primes p, q Question: is it the case that n-p q? Given: a number n, Question: is it the case that n p q for some primes p and q? Given: an NFA A and a word uw Question: Does A accept w? Given: an NFA A Question: Is there any word w such that A accepts w cate the laguages corresponding to the following four problems 1. In cpts317, we learned that a problem is a language. Such a statement builds a link from 317 to 350. For instance, consider the following problem: Given: a graph G Question is G connected? This problem corresponds to the language that puts all the string encodings of the positive instances of the problem into: G) G is a connected graph), where (G) is a string encoding of graph G Please indi Given: a number n and two primes p, q Question: is it the case that n-p q? Given: a number n, Question: is it the case that n p q for some primes p and q? Given: an NFA A and a word uw Question: Does A accept w? Given: an NFA A Question: Is there any word w such that A accepts w cate the laguages corresponding to the following four problems