Consider the following code for Union of a sorted linked list-based Set, which uses a merge algorithm. We make a few simplifying assumptions neither input set is empty and we have access to the Sorted List methods through the SetType objects (eg. PutItem, GetLength, etc.) Because we are using a sorted list, the ItemType must overload the "

SetType Union(SetType setB) I Reset both sets so we can iterate from the beginning Reset0 setB Reset(): Il The set for storing the union SetType result - new SetType) ItemType a = , Item Type b- i // #2 int alength 0 int blength 0; while (acount