please help solve 1(c) and (d), thank you.

1. For the following problems, describe a brute-force algorithm for solving them, and determine (an upper bound on the time complexity of your algorithm. (c) For a given set of points {(f1, y), ..., (In, Yn)} in the plane, determine the smallest distance between any two of them. Assume that all arithmetic operations on the coordinates can be performed in 0(1) time. = (d) For a given set of points {P1, ... , Pn} = {(t1, y), ..., (Xn, Yn)} in the plane, find the shortest path that starts and ends at P1 = (11,Y) and visits every point at least once. =