Suppose a scheme, requires at least k people. all people carry the same amount of unique information and k − 1 people are not sufficient. if only b − a people come together, where b > a, how man possible polynomials would they need to try?

step-by-step explanation:

y = | -2(-2) |     →     y = | 4 |     →     y = 4       ⇒   (-2, 4)

y = | -2(-1) |     →     y = | 2 |     →       y =   2       ⇒   (-1, 2)    

y = | -2(0) |     →     y = | 0 |     →       y = 0         ⇒   (0, 0)

y = | -2(1) |   c →     y = | -2 |     →     y =   2         ⇒   (1, 2)    

y = | -2(2) |     →     y = | - 4 |     →     y =   4         ⇒   (2, 4)  

pls refer ro the top for answer