In this data set, we have a point pattern of m healthy trees H and a point pattern of n sick trees S. For each point hi within H, we denote the distance to the nearest neighbor within H as d min (hi ) and the mean nearest neighbor distance as d min (h) = d min (hi ) m. Similarly, for each point si within S we denote the distance to the nearest neighbor within S as d min (si ) and the mean nearest neighbor distance as d min (si ) = d min (si ) n. We are also interested in the distances between sick and healthy trees. For each point hi within H we denote the distance to the nearest sick neighbor within S as d min (hi, s), and the mean nearest sick neighbor distance as d min (h, s) = d min (hi, s) m. Similarly, for each point si within S we denote the distance to the nearest healthy neighbor within H as d min (si, h), and the mean nearest healthy neighbor distance as d min (s, h) = d min (si, h) n. 1. Under the random infection hypothesis, do you expect d min (h) to be greater than, less than, or equal to d min (h,s) and why? Assume approximately equal numbers of healthy and diseased trees. (2 points) 2. Under the contagion hypothesis, do you expect d min (h) to be greater than, less than, or equal to d min (h,s) and why? Assume approximately equal numbers of healthy and diseased trees. (2 points)