Fill in the procedure called DrawConvexHull, which should draw a sequence of conneted lines, defining a closed polygon, which encloses all the points. More precisely, the convex hull is the *smallest* convex polygon that encloses all the points. (A *convex* shape has this property: given any two points inside the shape, each point along the line segment that connects these two points is also inside the shape.) Do not be too concerned with the efficiency of your algorithm. A "brute force" approach is okay??"it will suffice for the small numbers of points that we will be dealt with (generally fewer than 20). I have included all of the rest of the code in the zip file below. Thanks.
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):
a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.
b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.
3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).
## Platform
Windows XP. Microsoft Visual Studio. C++.