Assume that you and three of your classmates are charged with developing the first prototype to implement the RMO use case Create/update customer account. Create a development and testing plan to write and test the classes and methods. Assume that you have two weeks to complete all tasks. 1. Create a development and test plan to write and test the classes and methods
2. Assume you've got 2 weeks to complete all those tasks in your project plan
3. Write at least 5 test cases to support the Create/Update customer accoun

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).