Given below are some categories of languages. (R) Regular Languages (C) Context Free Languages (P) Polynomail Time Languages (NP) Nondeterministically Polynomial Time Languages. (D) Decidable Languages (T) Recognizable Languages (L) All Languages Classify each of the languages below into the smallest category (from above) that they provably belong. Each correct answer is 1 point. L = {w | w sum {0, 1}*, value (w) = 5} where value (w) represents the value of the binary string in decimal. S_TM = {lt M gt | 011 sum L(M)} L = {0^2n | n > 0} L = {w | w sum {0, 1}* such that value (w) is prime} E_TM bar where E_TM = {lt M gt | L (M) = 0} PrimeFactor = {lt m, n gt | n is a prime factor for m} L = {0, 1}*\{0^n 1^n|n > 0} where \ represents the set difference operation. L = {0^n 1^m 2^I 3^n | n > 0, m > 0, l > 0, m lessthanorequalto l} KnightPath = {lt n, s, t gt | there exists a sequence of knight moves on an n times n chess board form the square s to the square t} A language B such that A_TM bar lessthanorequalto m B