q2.cpp

void _empty(int* Sk, int& T, int n) {
    int groupCount = 0;
    do {
        //m will be the top-most item on the stack and on subsequent groups
        int m = Sk[T];

        //Remove all m elements from the stack
        T = T - m - 1;
        groupCount += 1;
    } while (T > 0);
    cout << "The number of groups is " << groupCount << "\n";
}