please solve

and where is negligible in the security parameter. Show that if an encryption scheme is secure according to the game-style definition, then it is secure under the semantic definition. Note: the converse is also true. Try to prove that as well. It is a little harder though.

6. For IND-CPA security, recall that we had two definitions: a "game-style" definition, and the "semantic" definition, stating that for all distributions D on the message space M. and for all predicates P:M = {0,1), any efficient algorithm that predicts the predicate on input of a ciphertext will succeed with probability at most I +6, where 1 = max Pr (P(m) = b) (0.1)