It is the first day of the big bakeoff! Who will be invited to compete in round 2? Because so many are baking, the competition is fierce. People will be invited to compete in round 2 if they are in the top 1/3 of all bakers. As the scores are posted, everyone wants to know who currently in the top 1/3. When a judge finishes a evaluating a baker, the baker's score is added to a scoreboard. Those who have all their scores in the top 1/3 will be invited to play in the tournament. Thus it is important for people to quickly to know if they are in the top 1/3. Design an algorithm to keep track of the top 1/3 bakers as scores are added one at a time (O(log n) time for each inserted item) and O(n) space. (Hint: use two binary heaps.) Reminder: The median of 1,9, 21 is 9. The median of 1,3,9, 21 is 349. The median of 1,3,9, 21, 56 is 9. It is the first day of the big bakeoff! Who will be invited to compete in round 2? Because so many are baking, the competition is fierce. People will be invited to compete in round 2 if they are in the top 1/3 of all bakers. As the scores are posted, everyone wants to know who currently in the top 1/3. When a judge finishes a evaluating a baker, the baker's score is added to a scoreboard. Those who have all their scores in the top 1/3 will be invited to play in the tournament. Thus it is important for people to quickly to know if they are in the top 1/3. Design an algorithm to keep track of the top 1/3 bakers as scores are added one at a time (O(log n) time for each inserted item) and O(n) space. (Hint: use two binary heaps.) Reminder: The median of 1,9, 21 is 9. The median of 1,3,9, 21 is 349. The median of 1,3,9, 21, 56 is 9