Step 1: The problem asks for the probability that two randomly chosen smallest squares on a chessboard share a side. A standard chessboard consists of \(8 \times 8\) squares, which means there are 64 total small squares.
Step 2: The number of possible pairs of squares is given by \(\binom{64}{2}\).
Step 3: The number of favorable outcomes where two squares have a side in common is based on the number of adjacent squares. Each square has up to 4 adjacent squares (except for the edge squares), and the total number of such adjacent square pairs is fewer than 64, as we are restricted to squares that share a side.
Step 4: By counting the adjacent pairs (both horizontally and vertically) and dividing by the total number of pairs, we obtain the probability \(\frac{1}{18}\).
Based upon the results of regular medical check-ups in a hospital, it was found that out of 1000 people, 700 were very healthy, 200 maintained average health and 100 had a poor health record.
Let \( A_1 \): People with good health,
\( A_2 \): People with average health,
and \( A_3 \): People with poor health.
During a pandemic, the data expressed that the chances of people contracting the disease from category \( A_1, A_2 \) and \( A_3 \) are 25%, 35% and 50%, respectively.
Based upon the above information, answer the following questions:
(i) A person was tested randomly. What is the probability that he/she has contracted the disease?}
(ii) Given that the person has not contracted the disease, what is the probability that the person is from category \( A_2 \)?