Answer Happy

Help Needed Please - I will thumbs up ASAP if everything is
correct and proven!
3. (Polynomial-time verifies, 20pt) Show that the following two computational problems have polynomial-time verifies; to do so explicitly state what the certificate cc is in each case, and what VV does to verify it. = a) [10pt] SSSSSSSSSSSSSSSS = {(SS, SS): SS contains SS as a subgraph}. (See Section 0.2 for definition of subgraph.) b) [10pt] EEEE_DDDDVV = {(SS): SS is equally dividable}. = = Here we call a set SS of integers equally dividable if SS = SS USS for two disjoint sets SS, SS such that the sum of the elements in SS is the same as the sum of the elements in SS. E.g. {-3,4,5,7,9} is equally dividable as SS = {-3,5,9} and SS = {4, 7} but SS = {1, 4, 9} is not equally dividable. = =