Question

A secret message is divided into Θ parts and each part is shared with a different

person. People communicate with each other using two-way phone calls and, in each

communication, share all the information they know until that point. What is the minimum

number of communications required for all Θ of them to know the secret? Find a

sequence of communications that achieves this minimum

Answer 1

The Minimum no. of communications required = (2I-3)

Visit all the adjacent nodes starting from Node 1 in a circular queue traversal.
count visit from node 'N' to node 'N+1' as 1 and go on traversing till count (2I-3).

if Θ=0 then communications =0
if Θ=1 then communications =0
if Θ=2 then communications =1 - AB
if Θ=3 then communications =3 - AB BC AC
if Θ=4 then communications =4 - AB CD CB AD
if Θ=5 then communications =6 - AB DE AC CD AE CB
if Θ=6 then communications =8 - AB CD EF AC BE AF BD CE
if Θ=7 then communications =10-AB CD EF AC GE AE BG CB DG FG
if Θ=8 then communications =12-AB CD EF GH AC FH AF CH BE DG BD EG , now mark me as brainiest