B points a node in circular linked list with at least 20 students. Implement CountMinAge() to find the number of youngest Math students. For example, if the youngest student is 17-year, then you need to return how many of Math students are 17-year old. stu* B; struct stu{ int age; char degree; // C for CS, M for Math node* next; }; CountMinAge(stu* B) { }