I have this assignment that is due. It is pretty simple from what the professor has said. If possible to do, please code this in the most simplest way as possible. Such that a basic programmer looked like it programmed it. Please use the given starter code and as minimal advanced and complex coding as possible.Also, for pricing, I have $50 on my account to use. For my last assignment I posted, I paid $70 to get it done. No one got it done correctly whatsoever and I did not get my refund. I expect for this assignment to just use my $50 on my account to pay for itDocument Preview:output100.gif input.pgm output2.pgm output10.pgm output20.pgm output50.pgm output100.pgm startercode.cpp includeincludeinclude linklist.h include region.h include pnmdefs.h using namespace std; int main(int argc,char *argv[]) { int i,j; pnm Image;int index; region *R,*R1,*R2;linklist nodes,list2;//Validate argumentsif (argcaddPixel(index,Image.data[index]); //Add current pixel to new region index++; } }//Initial horizontal neighborsnodes.rewind(); for (j=0; jaddNeighbor(R2); R2->addNeighbor(R1); } }//Initial vertical neighborslist2.shallowCopy(nodes);list2.rewind(); for (i=0; iaddNeighbor(R2); R2->addNeighbor(R1); } }list2.shallowClear();//Compute initial matching costs between all neighborsnodes.rewind(); while (nodes.getNext(R)) R->computeBestMatch();//Merging processlistnode *node2delete;while ( nodes.getSize() > atoi(argv[3]) ) {nodes.rewind(); nodes.getNext(R1);//Here we find the nodes with the minimum discrepancy score //Note that a much faster way to do this (and how to get up //to 50 points extra Attachments: HM7.zip