EDIT: What's being requested is an updated code and screenshot for each task $($except for task $1).$ I$\text{'}$m sorry, but that's all the information given. When I say terminal, I mean the terminal that is used for code, you can use another compiler. The parts of the code that tell you to insert in refer to changes you have to make in tasks. Sorry if it's confusing.

$($Not hard but my terminal isn't working for me$.$ Part $3-$which is the last part so don't be worried$-$ might require some thinking$)$

The following is Vector$20$Main.cpp and Vector$20.$h

Vector$20$Main.cpp

#include

#include

#include "Vector$20.$h$"$

using namespace std;

$//$ printing values in a Vector$20$ object

void print$\_$Vector$20($Vector$20)$;

int main$()$

$\{$

Vector$20$ myvec;

for $($int i $=1$; i $<=25$; i$++)$

$\{$

myvec.push$\_$back$($i $*11)$; $//$ entering $25$ values into myvec;

$\}$

print$\_$Vector$20($myvec$)$; $//$ showing contents of myvec

$//$ asking for target index and how many times an erase is to happen

$//$ at this index;

$/*--$ UNCOMMENT FOR TASK $2---$

int target;

int howmany;

cout $<<$ "Enter index of element to erase $[0-"<<$ myvec.size$()-1<<"]$: $"$;

cin $>>$ target;

cout $<<$ endl;

cout $<<$ "Erase at this index how many times $[0-"<<$ myvec.size$()-$ target

$<<"]$: $"$;

cin $>>$ howmany;

cout $<<$ endl;

for $($int i $=1$; i $<=$ howmany; $++$i$)$

$\{$

myvec.erase$($target$)$;

print$\_$Vector$20($myvec$)$;

cout $<<$ endl;

$\}$

cout $<<$ endl;

$*/$

$//$ asking for a target index and how many times value $999$ is

$//$ to be inserted at this index

$/*--$ UNCOMMENT FOR TASK $3--$

cout $<<$ "Enter index of element to insert $999[0-"<<$ myvec.size$()-1<<$

$"]$: $"$;

cin $>>$ target;

cout $<<$ endl;

cout $<<$ "Insert at this index how many times $[0-"<<$ myvec.size$()-1<<$

$"]$: $"$;

cin $>>$ howmany;

cout $<<$ endl;

for $($int i $=1$; i $<=$ howmany; $++$i$)$

$\{$

myvec.insert$($target$,999)$;

print$\_$Vector$20($myvec$)$;

cout $<<$ endl;

$\}$

$*/$

return $0$;

$\}$

void print$\_$Vector$20($Vector$20$ vec$)$

$\{$

for $($int i $=0$; i $<$ vec.size$()$; $++$i$)$

cout $<<$ vec$[$i$]<<""$;

cout $<<$ endl

$<<$ endl;

$\}$

Vector$20.$h

#ifndef VECTOR$20\_$H

#define VECTOR$20\_$H

#include

#include

using namespace std;

template

class Vector$20$

$\{$

public:

Vector$20()$

: theSize$\{0\},$ theCapacity$\{20\}$

$\{$

data $=$ new T$[$theCapacity$]$;

$\}$

Vector$20($const Vector$20$ &rhs$)$

: theSize$\{$rhs$.$theSize$\},$ theCapacity$\{$rhs$.$theCapacity$\},$ data$\{$nullptr$\}$

$\{$

data $=$ new T$[$theCapacity$]$;

for $($int k $=0$; k $<$ theSize; $++$k$)$

data$[$k$]=$ rhs$.$data$[$k$]$;

$\}$

Vector$20$ &operator$=($const Vector$20$ &rhs$)$

$\{$

for $($int k $=0$; k $<$ theSize; $++$k$)$

data$[$k$]=$ rhs$.$data$[$k$]$;

return $*$this;

$\}$

~Vector$20()$

$\{$

delete$[]$ data;

$\}$

bool empty$()$ const

$\{$

return theSize $==0$;

$\}$

int size$()$ const

$\{$

return theSize;

$\}$

int capacity$()$ const

$\{$

return theCapacity;

$\}$

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

$\{$

assert$($index $>=0$ && index $<$ theSize$)$;

return data$[$index$]$;

$\}$

T &back$()$ const

$\{$

return data$[$theSize $-1]$;

$\}$

T &front$()$ const

$\{$

return data$[0]$;

$\}$

void push$\_$back$($const T &x$)$

$\{$

if $($theSize $<$ theCapacity$)$

$\{$

$//$ cout $<<$ "within capacity $..."<<$ endl;

data$[$theSize$]=$ x;

theSize$++$;

$\}$

else

$\{$

$//$ cout $<<$ "EXPAND capacity $..."<<$ endl;

T $*$moredata $=$ new T$[$theCapacity $*2+1]$;

for $($int i $=0$; i $<$ theSize; $++$i$)$

$\{$

moredata$[$i$]=$ std::move$($data$[$i$])$;

$\}$

std::swap$($data$,$ moredata$)$;

delete$[]$ moredata;

theCapacity $=$ theCapacity $*2+1$;

data$[$theSize$]=$ x;

theSize$++$;

$\}$

$\}$

void pop$\_$back$()$

$\{$

$--$theSize;

$\}$

$//$ to be added in by you

$//$ copy it in

void erase$($int index$)$

$\{$

$//$ to be filled by you

return;

$\}$

$//$ to be added in by you

$//$ to be written by you

void insert$($int index, int value$)$

$\{$

$//$ to be filled in a task

return;

$\}$

private:

int theSize;

int theCapacity;

T $*$data;

$\}$;

#endif

Your tasks are as follows:

Task $1$:

Compile and run in a terminal using:

g$++-$o lab$4$ Vector$20$Main.cpp

$./$lab$4$

Task $2$:

Insert the following erase$()$ function

void erase $($int index$)$

$\{$

assert $($index $>=0$ && index $<$ theSize$)$;

if $($index $==$ theSize $-1)$

$\{$

pop$\_$back$()$;

return;

$\}$

for $($int i $=$ index $+1$; i $<$ theSize; i$++)$

$\{$

data$[$i$-1]=$ data $[$i$]$;

$\}$

pop$\_$back$()$;

return;

$\}$

Test it with Vector$20$Main.cpp$,$ and MAKE SURE you uncommented the part that says uncomment for task $2.$After that, recompile and run again.

Task $3$:

Here is an insert function:

void insert$($iterator itrs, int value$)$

$\{$

if $($itz $==$ endl$())$

$\{$

push$\_$back$($value$)$;

return;

$\}$

assert$($itr $>=$ begin$()$ && itr $<$ endl$())$;

push$\_$back$($back$())$;

iterator itr$1=$ end$()-2$;

iterator itr$2=$ end$()-1$;

while $($itr$1>=$ itr$)$

$\{$

$*$ itr$2=$itr$1$;

itr$1--$;

itr$2--$;

$\}$

$*$itr $=$ value;

return;

$\}$

Add to the class $`$Vector$20`$ an $`$insert$()`$ function. Given an index

$($target$)$ and a new value $($x$),$ the insert function is to insert the stated

value at the stated index. The one shown is just for you to get an idea on what to do$.$ You will develop this on your own, as you must:

$$ Add a copy of the vector's last $($back$)$ element using

$`$push$\_$back$`.$

$$ Beginning at index $`$theSize $-2`$ and ending at the target index,

copy each element to the next index $(`+1`).$

$$ Place the new value $`$x$`$ at the target index.

$2.$ Test your $`$insert$()`$ function with the provided $`$Vector$20$Main.cpp$`$ file

after uncommenting the relevant portion marked with "UNCOMMENT

FOR TASK $3."$

$3.$ Recompile and run

I sincerely appreciate your assistance.