Design an time algorithm that takes as input the list of pairs of people who know each other and outputs the best choice of party invitees (the guest list which meets the constraints and has maximum size). You may assume you have hashing functionality whenever needed and that and . For up to 3 bonus points, design an algorithm that is You can assume that all the friends are numbered from 1 to n.

Grace is standing 18 feet from a lighthouse and kelly is standing 10 feet from grace. the angle that grace looks up to see the top of the lighthouse is 45°. the angle that kelly looks up to see the top of the lighthouse is y°. find the height, h, of the lighthouse. find the angle, rounded to the nearest tenth of a degree, in which kelly looks up to the top of the lighthouse. to the nearest tenth of a degree, find the value of x° . in two or more sentences, explain your calculations