Company: Barclays
Difficulty: medium
Satellite Communication Network A space organization has N satellites in orbit. The satellites are assigned IDs from 0 to N-1. A satellite can transfer data to any other satellite that lies within its bandwidth range. A team at organization is working on a project involving satellite communications. In this project, they wish to transfer data from the main satellite with ID 0 to all the other satellites. But because the transfer of data requires an enormous amount of power, a satellite can transfer data to only one other satellite at a time. Then, the satellite can connect to the server at organization which will help to connect this satellite to other satellites near it. Only a fixed number of satellites can be in the bandwidth range of a satellite at a time. The team wishes to determine the minimum number of iterations of data transfer necessary to connect all the satellites. Write an algorithm to help the team to determine the minimum number of iterations of data transfer necessary