HELP WITH THE QUESTION, AND PLEASE DO NOT COPY AND PASTE FROM CHEGG, I HAVE POSTED THIS QUESTION BEFORE BUT ANS I GOT IS WRONG.

CODES :

// // main.cpp //

#include #include #include "Circle.h" using namespace std;

int main(int argc, const char * argv[]) { const int numCircle = 5; Circle* arr_c = new Circle[numCircle]; arr_c[0] = (Circle(0, 0, 3)); arr_c[1] = (Circle(0, 0, 5)); arr_c[2] = (Circle(25, 25, 1)); arr_c[3] = (Circle(1, 1, 1)); arr_c[4] = (Circle(-1, -2, 2)); Circle cTest; int lar = cTest.findLargest(arr_c, numCircle); double h_lar, k_lar, r_lar; arr_c[lar].getCircleInfo(h_lar, k_lar, r_lar); cout getCircleInfo(h, k, r); cout

------------------------------------------------------------------------------------------------------------------------------------------------

// // Circle.hpp //

#ifndef Circle_h #define Circle_h

#include #include class Circle{ private: double h, k, radius; // (h, k) = circle coordinate

public:

// A default constructor // Set the centre and radius of circle as 0. Circle();

// Constructor with the centre of circle. // Set the radius as 0. Circle (double h, double k);

// Constructor with the centre of circle and raidus. Circle (double h, double k, double r);

// Set centre of the circle void setCentre(double h, double k); // Get centre of the circle void getCircleInfo(double &h, double &k, double &r);

// Set radius of the circle void setRadius(double r);

// Returns area of the circle double getArea();

// Returns the index of the largest circle within an array of circles // If two circles are in the same size, return the first encountered int findLargest(Circle* c_arr, int size);

// Check whether parameterized circle is within the circle // Hint: // The smaller circle lies completely inside the bigger circle without touching // each other at a point of circumference. // If this case happens, the sum of the distance between the centres and // smaller radius is lesser than the bigger radius, then obviously the smaller // circle lies completely inside the circle, without touching the circumference.

bool checkWithin(const Circle& c);

// Return a vector of circles overlapping the largest circle Circle** overlapping(Circle* vc, int arrSize);

//destructor ~Circle(); };

#endif /* Circle_hpp */

2. Write a class Circle that