ASSIGNMENT $1-$ON DISTRIBUTED COMPUTING $-$Scenario: Dynamic Peer$-$to$-$Peer File SharingImagine a large$-$scale, decentralized peer$-$to$-$peer $($P$2$P$)$ file$-$sharing network. Here's the setting:Dynamic Nature:$$Nodes $($peers$)$ can join or leave the network unexpectedly.File Distribution:$$Users search for files, and downloads happen in chunks from multiple peers simultaneously.No Central Coordination:$$There$\text{'}$s no central server to track activity.The Challenge: Termination DetectionA user initiates a "global clean$-$up$"$ operation. This means:All active file transfers must complete or gracefully abort.The network must determine when it's safe to release resources used for the clean$-$up operation itself.Assignment TaskStudents must design and describe a spanning$-$tree$-$based termination detection algorithm suitable for this P$2$P scenario. They should address:Spanning Tree $($Re$)$Construction:$$How to maintain a valid spanning tree when nodes join$/$leave$.$Initiation:$$How does a clean$-$up request get disseminated to the entire network?Message Handling:$$What types of messages are needed to detect termination $($e$.$g$.,$ "idle" signals, acknowledgments$)?$False Termination:$$How to prevent premature termination signals due to temporary inactivity in parts of the network?Resource Release:$$How does the initiating node know it's truly safe to release clean$-$up resources?Touch PointsFault Tolerance:$$Students should consider how their algorithm handles node failures or message loss.Efficiency:$$Minimizing message overhead is crucial in a large, dynamic P$2$P network.Scalability:$$The algorithm should work well on networks of varying sizes.SubmissionStudents should provide:Algorithm Description:$$A clear written explanation of their algorithm's logic.Pseudocode $($Optional$)$:$$If feasible, simplified pseudocode for key steps.Justifications:$$Reasoning behind their design choices, addressing the challenges and "touch points."Let's Increase the Difficulty! Choose one or more to add:Overlapping Clean$-$ups:$$What if multiple clean$-$up$$operations overlap in time?Heterogeneity:$$Nodes have different speeds$/$capabilities$.$ How does that impact tracking activity?