I need help completing main.cpp using what I have given: the header, MyVector.h and MyVector.hpp doesn$$t need changed. What would the main function code look like using what I have already? $($Solving the main function code so the input and output given are solved$)$ Please show with actual code, C$++$

MyVector.h below:

#ifndef MYVECTOR$\_$H

#define MYVECTOR$\_$H

#include

#include

#include

using std::cerr;

using std::cin;

using std::cout;

using std::endl;

using std::string;

class ArrayListIterator $\{$

int index;

public:

ArrayListIterator$($int i$)$ : index$($i$)\{\}$

operator int$()\{$

return index;

$\}//$ allows Iterator to be used like an int$/$index

ArrayListIterator operator$+($int increment$)\{$

index $+=$ increment;

return $*$this;

$\}//$ allows $+/++$

bool operator$>($int comp$)\{$ return index $>$ comp; $\}$

bool operator$<mi>(</mi>$int comp$)\{$ return index $$ comp; $\}$

$\}$;

template class MyVector $\{$

private:

T $*$data $=$ nullptr;

int max$\_$elements;

int num$\_$elements;

public:

$//$ Just a simple default constructor.

MyVector$()$ : max$\_$elements$(4),$ num$\_$elements$(0)\{$ data $=$ new T$[4]$; $\}$

~MyVector$()$;

const MyVector &operator$=($const MyVector &source$)$;

MyVector$($const MyVector &source$)$;

T &operator$[]($int index$)$;

T &at$($int index$)$;

T &front$()$;

T &back$()$;

unsigned int capacity$()$;

void reserve$($int new$\_$max$\_$elements$)$;

void shrink$\_$to$\_$fit$()$;

void clear$()$;

void push$\_$back$($const T &value$)$;

void pop$\_$back$()$;

void insert$($ArrayListIterator position, const T &value$)$;

void erase$($ArrayListIterator position$)$;

unsigned int size$()$;

int find$($const T &value$)$;

void swap$($MyVector &other$)$;

ArrayListIterator begin$()\{$ return ArrayListIterator$(0)$; $\}$

ArrayListIterator end$()\{$ return ArrayListIterator$($num$\_$elements$)$; $\}$

$\}$;

template

std::ostream &operatorstd::ostream &out, MyVector &my$\_$list$)\{$

out ;

for $($int i $=0$; i $$ my$\_$list.size$()$; i$++)\{$

out $$ my$\_$list.at$($i;

$\}$

out ;

return out;

$\}$

#include "MyVector.hpp$"$

#endif

Main.cpp below:

#include "MyVector.h$"$

#include

#include

using namespace std;

void print$\_$schedule$($MyVector &theVector$)$;

void add$($MyVector &theVector, const string &jobTitle, int timeSlot$)$;

void fire$($MyVector &theVector, const string &jobTitle$)$;

void sleepIn$($MyVector &theVector, int time$)$;

void carCrash$($MyVector &theVector, int timeSlot$)$;

void disease$($MyVector &theVector$)$;

int main$()\{$

MyVector schedule;

string startingJob;

for $($int i $=0$; i $<mtext></mtext><mn>3</mn>$; i$++)\{$

cin $>>$ startingJob;

schedule.push$\_$back$($startingJob$)$;

$\}$

string func $=""$;

int total$\_$days;

cin $>>$ total$\_$days;

for $($int day $=0$; day $$ total$\_$days; day$++)\{$

$//$ Finish me$!$

$\}$

return $0$;

$\}$

$/*$

"Suggested" functions below.

Feel free to complete them, change them, or ignore them,

the correct output is all you will be graded on

$*/$

void print$\_$schedule$($MyVector &theVector$)\{$

int numJobs $=$ theVector.size$()$;

if $($numJobs $==0)$

cout $$ "Unemployed" $$ endl;

else $\{$

for $($int i $=0$; i $$ numJobs $-1$; i$++)\{$

cout $$ theVector$[$i;

$\}$

cout $$ theVector$[$numJobs $-1]$ endl;

$\}$

$\}$

$//$ add function $-$ Inserts job in the given time slot

$//$ If timeslot $>=$ len of MyVector is passed,

$//$ job is appended to the end.

void add$($MyVector &theVector, const string &jobTitle, int timeSlot$)\{\}$

$//$ If he is fired from a specific job, it goes

$//$ through his schedule from back to front,

$//$ erasing each instance of that job from his schedule

void fire$($MyVector &theVector, const string &jobTitle$)\{\}$

$//$ Perform the "Sleep in$"$ event

void sleepIn$($MyVector &theVector, int time$)\{\}$

$//$ Perform the "Car crash" event

void carCrash$($MyVector &theVector, int timeSlot$)\{\}$

$//$ Perform the "Disease" event

void disease$($MyVector &theVector$)\{\}$

And the myVector.hpp is split between two photos attached