Write a program that represents a popular kid’s toy that teaches them about different shapes and colors.

Your toy should include:

a red square

a blue circle

a yellow semicircle

a green pentagon

These shapes should be centered in a square formation on the canvas and should each have radii of 60 pixels. You should use only the circle() command to create all shapes. (Remember the extended parameters we learned about!)

In many applications, only a small percentage of the points in a given set p of n points are extreme. in such a case, the convex hull of p has less than n vertices. this can actually make our algorithm convexhull run faster than θ(nlogn). assume, for instance, that the expected number of extreme points in a random sample of p of size r is o(rα ), for some constant α < 1. (this is true when the set p has been created by picking points uniformly at random in a ball.) prove that under this condition, the running time of the algorithm is o(n).