true or False with prove?

(f) ___ NP =co-NP (g) The complement of any recursive language is recursive. h) The grader's problem is decidable. We say programs Pi and P are equivalent if they give the same output if given the same input. The problem is to decide whether two programs (in C++, Pascal, Java, or some other modern programming language) are equivalent. )Given any CF language L, there is always an unambiguous CF grammar which generates L 6)Given any CF language L, there is always an ambiguous CF grammar which generates L (k)If G is a CF grammar and w E L(G), then the leftmost derivation of w must be unique. (I)If a language is accepted by some machine, then it must be decidable. (m) The Knapsack problem "Given a finite set of items of various weights, and given a knapsack that has a given capacity, does there exist a set of items which exactly flls the knapsack?") is kmown to be in the class P