Q2 What am I?

Consider the function Magic, whose pseudocode is illustrated below. The algorithm takes a graph as an input and outputs a number. The algorithm also uses a global array p that holds a Boolean value for every vV and two global integer variables s and c.

Given a graph G with n vertices and m edges, then the function Magic returns:

Choice 1: the total number of vertices in components of G with more than 10 vertices

Choice 2: the total number of vertices in components of G with at most 10 vertices

Choice 3: the number of components of G with at most 10 vertices

Choice 4: the number of components of G with at most 10 edges

Choice 5: the number of components of G with more than 10 vertices

Choice 6: the number of components of G with more than 10 edges

Choice 7: none of the above