Prime numbers are numbers, greater than 1, which are not evenly divisible by any number other than one and themselves. Initialize the vector named primes with the first eight prime numbers. Complete the following file: vectors.cpp 1 #include 2 #include 3 using namespace std; 4 5 int main() 6 { 7 vector primes(8); 8 cout << "size: " «< primes.size() << endl; 9 cout << "primes.at(6): "« primes.at(6) «< endl; 10 cout << "primes.at(3): "« primes.at(3) << endl; 11 cout << "primes.at(0): " « primes.at(0) «< endl; 12 } 提交 Testing vectors.cpp Actual Expected size: 8 size: 8 primes. at (6): 0 primes. at (6): 17 Given a vector int>, return the sum of the first 2 elements in the list. If the size is less than 2, just sum up the elements that exist, returning O if the size is 0. Complete the following file: vectors.cpp 1 #include 2 using namespace std; 3 4. int doubleSum(const vector int>& v) 5 { 6 int result; 7 8 9 10 return result; 11 } Given a vector of odd size, return the sum of the first, last and middle elements. Complete the following file: vectors.cpp #include using namespace std; 1 2 3 4 5 6 7 8 9 10 11 int sumEnds (const vector int>& v) { int result; return result; }