Assume that a database is replicated across $7$ different sites. $1.$ If the system uses fully distributed locking, which of the following voting schemes $($if any$)$ would work? Explain briefly why each scheme would or would not work. a$.$ update $6$ copies, read $3$ copies b$.$ update $2$ copies, read $6$ copies c$.$ update $5$ copies, read $2$ copies d$.$ update $4$ copies, read $5$ copies e$.$ update $3$ copies, read $4$ copies $2.$ Now assume that the system uses primary$-$copy locking. Which of the following voting schemes $($if any$)$ would work? Explain briefly why each scheme would or would not work. a$.$ update $6$ copies, read $3$ copies b$.$ update $2$ copies, read $6$ copies c$.$ update $5$ copies, read $2$ copies d$.$ update $4$ copies, read $5$ copies e$.$ update $3$ copies, read $4$ copies