Vector2 is defined as:

#include

using namespace std;

class Vector2 {

private:

double x, y;

public:

Vector2(double x, double y)

: x(x), y(y) { }

Vector2 operator+(const Vector2& v)

{

return Vector2(x + v.x, y + v.y);

}

Vector2 operator*(double s)

{

return Vector2(s * x, s * y);

}

double operator*(const Vector2& v) // dot product

{

return x * v.x + y * v.y;

}

void print() { // print vector

std::cout << x << ", " << y << ' ';

}

friend ostream& operator<<(ostream& out, const Vector2& v) {

out << v.x << ", " << v.y << ' ';

return out;

}

};

use C++ to complete the problem:

a) Create an array "allVectors" with 10 Vector2 objects (initialize them to random points between 0 and 1). b) Add a member function/method "NearestVector" to Vector2 for finding the nearest among a list of vectors:

Vector2 a(3,4); b = a.NearestVector(allVectors);

Note 1: (Mathematically speaking) assume the vectors start from origin, then each vector represents a point. Note 2: Use the Pythagorian the distance between two vectors (points).