In the problems below, G = (V, E) is an undirected graph on n vertices and m edges, and assume m ? n.
a. A matching M is a subset of edges which don't share endpoints. Suppose G has a matching M
of size n/2, that is, it's a perfect matching. You sample a subset R ? V where every vertex v is
independently present in R with probability $p := \frac{s}{n}$. What is the smallest value of s, as a function of
n, such that the probability that R contains both the endpoints of some edge in M is at least 50%?
Clearly show your work explaining your reasoning.