10. The definition of NP-easy is on page 425 in the textbook. Let's call that definition Defl. Here is another definition of NP-easy. A problem A is called NP-easy if, for some NP-complete problem B, Let's call this definition Def2. Prove that Defl and Def2 are equal. In other words, if problem A is NP-easy by Defl, it should show that it is NP-easy by Def2, and if problem A is NP-easy by Def2, it should also show by Defl that it is NP-easy. Def 1 : A problem A is called NP-easy it, for some problem B in NP, A TB 10. The definition of NP-easy is on page 425 in the textbook. Let's call that definition Defl. Here is another definition of NP-easy. A problem A is called NP-easy if, for some NP-complete problem B, Let's call this definition Def2. Prove that Defl and Def2 are equal. In other words, if problem A is NP-easy by Defl, it should show that it is NP-easy by Def2, and if problem A is NP-easy by Def2, it should also show by Defl that it is NP-easy. Def 1 : A problem A is called NP-easy it, for some problem B in NP, A TB