Design a C++ solution to compute the nearest neighbour for a point in a vector of points. Clearly state the interface, and provide an implementations. Your solution should allow computing the distance using either Euclidean or Manhattan Distances. The distance between two points p(x, y), q(x, y) can be computed as: DEuclidean(p, q) = p (p.y q.y) 2 + (p.x q.x) 2 DManhattan(p, q) = |p.y q.y| + |p.x q.x

3. Design a C++ solution to compute the nearest neighbour for a point in a vector of points. Clearly state the interface, and provide an implementations. Your solution should allow computing the distance using either Euclidean or Manhattan Distances. The distance between two points p(x, y), q(x, y) can be computed as: D Euclidean(p, q) = V/ (py-q.y? + (p.r-q.r)2 DManhattan(p,q)-Ip.y-q-llp.-q.a