You're in charge of assigning parking spots to tour buses at the Capilano Suspension Bridge. The parking spots are numbered 1, 2, 3, . . . , m in order of distance from the entrance. At the start of the day, all spots are empty. When a bus arrives, the bus driver tells you the maximum distance from the entrance (Le. parking spot number) he is willing to park at. He is equally happy to park in any spot numbered less than or equal to that number. If no such spot exists, he will leave (and take his bus to the Capilano Fish Hatchery down the road). You want to maximize the number of buses that park at the bridge. Every bus stays for the entire day. Let dz- be the maximum parking spot number that the ith bus to arrive will park at (for i = 1, 2, . . . , 71.). What is the best spot to tell the first bus driver to park in? O (a) 1 (9 (b) d1 1 O (C) (111 (It may help to consider the case when the first three buses have d1 = 3, d2 = 2, and d3 = 1.) What sets do you initially create? Assume that you may only create sets at the start of the day. Provide values for A and B in the following code to initialize your disjointsets structure. for( d = A : d