Suppose there are three languages (i. e., problems), of which we know the following: 1. li is in p. 2. l2 is np-complete. 3. l3 is not in np. suppose also that we do not know anything about the resolution of the "p vs. np" question; for example, we do not know definitely whether p=np. classify each of the following languages as (a) definitely in p, (b) definitely in np (but perhaps not in p and perhaps not np-complete) (c) definitely np-complete (d) definitely not in np: l1 intersection l2.l1 [union] l2. l2cl3, where c is a symbol not in the alphabet of l2 or l3 (i. e., the marked concatenation of l2 and l3, where there is a unique marker symbol between the strings from l2 and l3). the complement of l3. based on your analysis, pick the correct, definitely true statement from the list below: a) l2cl3 is definitely in np. b) the complement of l3 is definitely not np-complete. c) l1 [union] l2 is definitely in np. d) l1 intersection l2 is definitely in p.