1) Three sets are represented with three integer vectors A, B and C. The following algorithm calculates three-way set disjointness. In easier terms the problem is to determine if the intersection of the three sets is empty.

Assume the size of each set to be n. Identify the worst-case scenario. Calculate the worst-case running time in asymptotic notation.

1) Three sets are represented with three integer vectors A, B and C. The following algorithm calculates three-way set disjointness. In easier terms the problem is to determine if the intersection of the three sets is empty. 1/* Returns true if there is no element common to all three arrays. 2public static boolean disjointl(int! | groupA, intl I groupB, int groupC) for (int a : groupA) or(int b groupB) for (int c:groupC) if ((a-b) && (b-c)) 7 8 return true; // we found a common value // if we reach this, sets are disjoint return false; Algorithm disjoint1 for testing three-way set disjointness