3. Consider the same scenario of the rain forest farmers that we saw in the previous question. Suppose that the situation had been almost the same as in the previous question, but with slightly different numbers. Again, all pairs of farmers who live within less than 6 miles of each other are connected by a strong tie. But now, all pairs of farmers who live at least 6 but less than 8 miles from each other are connected by a weak tie. Farmers who live at least 8 miles from each other do not have an edge in the social network. With these new numbers, do all nodes in the network satisfy the Strong Triadic Closure property? Explain your reasoning. [8 points] 4. Consider a regular lattice (similar to what we saw in Watts-Strogatz model), prove that the number of connections between neighbors is cc 2), where c is the average degree. [9 points) 3. Consider the same scenario of the rain forest farmers that we saw in the previous question. Suppose that the situation had been almost the same as in the previous question, but with slightly different numbers. Again, all pairs of farmers who live within less than 6 miles of each other are connected by a strong tie. But now, all pairs of farmers who live at least 6 but less than 8 miles from each other are connected by a weak tie. Farmers who live at least 8 miles from each other do not have an edge in the social network. With these new numbers, do all nodes in the network satisfy the Strong Triadic Closure property? Explain your reasoning. [8 points] 4. Consider a regular lattice (similar to what we saw in Watts-Strogatz model), prove that the number of connections between neighbors is cc 2), where c is the average degree. [9 points)