1. in the on-line convex-hull problem, we are given the set q of n points one point at a time. after receiving each point, we compute the convex hull of the points seen so far. obviously, we could run graham’s scan once for each point, with a total running time of o(n2lg n). show how to solve the on-line convex-hull problem in a total of o(n2) time.
2. show how to implement the incremental method for computing the convex hull of n points so that it runs in o(n lg n) time.

Cass decided to sell game programs for the hockey game. the printing cost was over 20 cents per program with a selling price of 50 cents each. cass sold all but 50 of the programs, and made a profit of $65. how many programs were printed? letting p represent the number of programs printed, set up an equation that describes this situation. then solve your equation for p.

For this option, you will work individually. the pythagorean theorem can be used in many real-world scenarios. part 1 write your own real-world scenario where the pythagorean theorem can be applied to find a missing piece. you may choose to write a problem that is two- or three-dimensional in nature. be sure that you will be able to draw a diagram of your scenario. write out your problem and submit it for part 1. be sure to end your scenario with a question. part 2 draw a diagram of the scenario you created in part 1. you may draw by hand and scan and upload your drawing or create a computer-generated drawing for submission. be sure to label all parts and dimensions of the drawing. part 3 solve the question that you posed in part 1. show all of your steps in answering the question. for this option, you will need to submit all three parts for full credit—your real-world problem and question, the diagram that you created, and your work solving the problem, showing all steps. * note that your instructor is looking for your own original idea. while it is acceptable to use the internet for research and inspiration, academic integrity policies apply.

Fred has a spinner that is split into four equal sections: red, blue, green, and yellow. fred spun the spinner 688 times. which of the following would be a good estimate of the number of times the spinner lands on the green section? a. 269 b. 603 c. 344 d. 189