I need help on this question. Please provide the solution with explaination. Thank you!

We learned that a problem is a language. For instance, consider the following problem: Given: a graph G, 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 indicate the languages corresponding to the following four problems: Given: a number n and two primes p, q, Question: is it the case that n = p middot q? Given: a number n, Question: is it the case that n = p middot q for some primes p and q? Given: an NFA A and a word w Question: Does A accept w ? Given: an NFA A Question: Is there any word w such that A accepts w