Formulate linear constraints in terms of binary variables for the four following cases:$($a$)$ At least K out of M inequalities $()0=1,,$ must be satisfied $($K $<$ M$).($b$)$ If A is true and B is true, then C is true or D is true.$($c$)$ The choice of all $0-1$ combinations for $,$ is feasible, except the one for which $=0,$ and $=1,,$ where N and B are specified partitions of J$.($d$)$ Given are two binary variables, x and y$.$ Define a third binary variable z to be one if x $=$ y