(cryptography): show an alternative method for Shamir's secret sharing(t,w) that is based on cut of k-dimensional spaces inside a space with n dimensions

explain and elaborate the following: a)what does every participant get?

b)what should be n and k?

c)how can the participants recover the shared secret?

please explain and elaborate. it helps me with upcoming exam.

thank you very much