Write a function, called distance, that takes a list of tuples representing points. The first value is the x-coordinate and the second value is the y-coordinate, so a point is defined by the tuple (x, y). The method should return the pair of points (a tuple of two points, i.e. tuple of tuples) that have the smallest euclidean distance, if multiple pairs of points have the same minimum distance you can return any of the pairs of points. Hint: you can compute distance between every possible pair of points and keep track of the smallest distance. Cannot use import math.