In the morning, 100 students study as 50 groups with two students in each group. In the afternoon, they study again as 50 groups with two students in each group. No matter how the groups in the morning or groups in the afternoon are established, if it is possible to find n students such that no two of them study together, what is the largest value of n?<spanclass=′latex−bold′>(A)</span>42<spanclass=′latex−bold′>(B)</span>38<spanclass=′latex−bold′>(C)</span>34<spanclass=′latex−bold′>(D)</span>25<spanclass=′latex−bold′>(E)</span>None of above