In this problem, we will show how we can use secret sharing for electronic voting. A $($n$,$k$)$ secret sharing scheme hides a secret number in n different shares and any k of them can be used to reconstruct it$.$ For example, in a $(3,2)$ secret$-$sharing scheme in modulo$-103$ field