3. A maximal independent set is a set of nodes / that satisfy the following properties for each node v El, none of its neighbors are in I, - for each node v at least one of ts nei Here is an example - the nodes labeled with a "1" form a maximal independent set: Your task is to design a distributed algorithm that finds a maximal independent set in any path graph, for each of the following settings: (c) Randomized algorithm that does not need unique identifiers