can you solve the following using distributed point functions:$-$ There are two servers S$0$ and S$1.$ There are C clients. Each client holds a string alpha i in $\{0,1\}^$n $.$ The servers want to learn the number of clients who hold a certain string sigma $.$ At the same time clients would like to keep their strings a secret.

$1.$Write a protocol that allows the servers to calculate the number of clients who hold sigma $($while learning nothing about the client$$s secret string$).$

$2.$Prove the correctness of your protocol $.$