Please add explanation as I have to study for a test. Thanks!

Problem 1. Let G be an arbitrary context-free grammar with the start symbol S. Which of the following statements concerning G are TRUE and which are FALSE? (a) if w, 2 E L(G), then ww E L(G); (TRUE/FALSE) (b) if strings w and w can be derived in G using the same number of steps, then this fact does not necessarily imply that wi = w2. (TRUE/FALSE) (c) if wi E L(G) and wi is a substring of w2, then w2 E L(G); (TRUE/FALSE) (d) S S; (e) L(G) is included in some regular language. (TRUE/FALSE) (TRUE/FALSE) Problem 1. Let G be an arbitrary context-free grammar with the start symbol S. Which of the following statements concerning G are TRUE and which are FALSE? (a) if w, 2 E L(G), then ww E L(G); (TRUE/FALSE) (b) if strings w and w can be derived in G using the same number of steps, then this fact does not necessarily imply that wi = w2. (TRUE/FALSE) (c) if wi E L(G) and wi is a substring of w2, then w2 E L(G); (TRUE/FALSE) (d) S S; (e) L(G) is included in some regular language. (TRUE/FALSE) (TRUE/FALSE)