2. Lct A and B be two authorised coalitions in a sccrct sharing scheme. We say that A can frame B if A can calculate the shares of B and submit them to recover the secret. Consider the linear secret sharing scheme with the set of participants P = {P0, P1, P2, P3, P4, P5}, where po is the dealer and let ho 1 0 0 hi 1 1 0 1 2 0 H= 1 1 1 2 4 h5 1 3 4 h2 h3 hy 1 be a matrix over Z. (a) Show that A= {P1, P2} and B = {P3, P4, P5} are minimal authorised coalitions: (b) Say with reason which of these coalitions can frame the other one. 2. Lct A and B be two authorised coalitions in a sccrct sharing scheme. We say that A can frame B if A can calculate the shares of B and submit them to recover the secret. Consider the linear secret sharing scheme with the set of participants P = {P0, P1, P2, P3, P4, P5}, where po is the dealer and let ho 1 0 0 hi 1 1 0 1 2 0 H= 1 1 1 2 4 h5 1 3 4 h2 h3 hy 1 be a matrix over Z. (a) Show that A= {P1, P2} and B = {P3, P4, P5} are minimal authorised coalitions: (b) Say with reason which of these coalitions can frame the other one