Question 2. Tracking, Data Association (16 pts) As part of a tracking problem, you want to match up two sets of objects, one set (labeled A,B,C,D) are detected at time T1, and the other set (labeled 1,2,3,4) are detected at a later time T2. The following is a table of scores measuring how similar each pair of objects are, with larger scores meaning more similar. Objects at time T2 Objects at time T1 1 2 3 4 ? A 75 16 34 26 B 71 66 96 75 c28 12 59 51 D 68 50 22 70 Assuming there is a 1-to-1 matching between the two sets of objects, use the greedy method described in class to approximately maximize the sum of similarity values of matched pairs. List the matched pairs recovered by the greedy method, along with the total similarity score for that solution. Dbjects time at T1 A | B | C Total score: Objects time at T2 4 pts Answer 1,2,3 or 4 to each of these (3 pts each)