I am studying about the basic principles of cryptography, secret sharing, and threshold schemes, cryptographic protocols and security models that consider multiple participants from textbook "Introduction to Modern Cryptography" by Mihir Bellare & Phillip Rogaway. And stucl with solving the proof:

Suppose there is a committee of five parties $P_1,P_2,$dots,$P_5$ who would like to securely share a secret $S.$ But they have somewhat special restrictions: the secret $S$ should only be recoverable by either $(1)P_1$ and any one other party $P_i(i1),$ or $(2)$ any group of at least three parties. Describe a sharing scheme for this scenario, and how $S$ is recovered by authorized sets of parties.