C$++$

we are going to implement a variant of the famous Josephus problem. Your goal is to travel to as many different destinations with your friends. The problem is that you can only

travel to one destination on any given trip. When you decide it is time to travel, you and your friends each

select a place to visit. Since you can only visit one place together on this trip, you must select which place to

travel. You came up with a way to make the selection process fun. The idea is that you will take into

consideration how many friends are traveling, which directly determines how many destinations are possible.

$(7$ pts$)$ You are required to design a concrete C$++$ class called Destination. The class declaration for this

class must be placed in Destination.h$.$ The corresponding function definitions must be placed in

Destination.cpp$.$ This class must contain at least the following public member functions:

$\backslash$deg constructor $-$ accepts inputs to set the position and name members described below

$\backslash$deg destructor

$\backslash$deg printPosition$()$ prints the current position of the destination in the sequence

$\backslash$deg printDestinationName$()$ prints the name of the destination city

$\backslash$deg Others?

The Destinationclass must also contain at least the following private data members:

$\backslash$deg position$($an integer$)$ position occupied by the destination location in the sequence; also could be

an ID

$\backslash$deg name$($a std::string$)$ name of the destination city