Using the definitions in Problem 6, consider a program with an overloaded method f. Assuming there are at least two definitions off that have different signatures, what is the minimum number of definitions of fand number of arguments to f for the overloading resolution algorithm to possibly report that there is not a unique best choice of f? O 2 definitions, 2 arguments O The algorithm, as defined, will always succeed. o 3 definitions, 1 argument O 2 definitions, 1 argument 0 3 definitions, no arguments o 3 definitions, 2 arguments o 2 definitions, no arguments In Cool, if class C already has method foo defined, it is not permitted to define a new method foo with a different number of arguments or with arguments of different types. However, it is possible to do so in languages like Java and C++, which support method overloading. You have decided to implement method overloading in Cool by using the same algorithm as in Java and C++. Consider a dispatch expression e. foo(e1, ..., en) in which eo : To and for each i, ei : T. Class To may have a set of one or more definitions of foo with different numbers or types of arguments (but no two definitions may have the same number and same types of arguments.) There are no constraints on the return types of the definitions - return types are not considered in the selection algorithm. From this set S foo we choose a definition such that: (1) the definition foo(x1 : T, ..., Un : T): T/ has n arguments, (2) for all i [1, n),T;