Consider the following point set:

Please draw each diagram separately.

(a) Using an algorithm of your choice, compute the Euclidean Minimum Spanning Tree of the point set. (b) Compute the Voronoi Diagram of the point set directly, using the perpendicular bisectors. (c) Compute the Delaunay Triangulation of the point set. (d) Compute the Relative Neighbourhood Graph of the point set by rejecting those edges of the Delaunay Triangulation whose lune contains other points from the set.