3 questions for c++ i have part of the answer so that will sure help

6)  Convert the forthcoming 2 aggregate to binary, octal and hex. 2.875, 0.1796875        When produced, change the forthcoming to a transport fidelity        by the restriction in dispose. In other suffrage, I neglect an 8 digit hex reckon fidelity using the 4 byte transport mention        defined in dispose. An pattern .pdf is robust for you to criticism.    b)  Do the similar for a) loving they are indirect prizes.   c)  Convert the transport fidelitys of the forthcoming into the decimal reckon loving the restriction in dispose. 59999901, 59999902, A66667FE Note:  This doesn't insist-upon a program, ultimately, I neglect you to transcribe a unblended duty that outputs the answers you did by index delay "cout". 3) I bear written a program for you to accomplished.  This adjudicationl is not tobe interjacent delay the menu.  Simply imimprint when I run the menu program thatit is interjacent in another device.  You are to transcribe a program that outputsthe medium, median, and adjudications.  Your operation is to accomplished the duty.  This accomplish use structures to by notice from one duty to the imimprint duty. Stats *stat(const Deck *array){    //Non-working stub to be accomplishedd by the student    cout<<endl<<"stat duty to be accomplishedd by the student"<<endl;    Stats *stats=new Stats;    stats->mode=new Array;    stats->mode->size=0;    int nModes=0;    stats->mode->data=new int[nModes];    stats->modFreq=1;    stats->median=0;    return stats;} I bear as-well supplied the expected outputs you can collate aggravate in aStatResults.txt finish.  output   This gives 3 pattern outputs. Original Array0 1 2 3 4 5 6 7  The medium of the deck = 3.5The median of the deck  = 3.5The reckon of adjudications      = 0The max Frequency        = 1The adjudication set             = {null}   Original Array0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0  The medium of the deck = 4.35484The median of the deck  = 4The reckon of adjudications      = 1The max Frequency        = 4The adjudication set             = {0}    Original Array0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8  The medium of the deck = 4.38462The median of the deck  = 4The reckon of adjudications      = 9The max Frequency        = 4The adjudication set             = {0,1,2,3,4,5,6,7,8}   2) Develop an impression using an deck of structures that accomplish state the bulk pay for any reckon of employees input. The guild pays "straight-time" for the chief 40 hours worked, wrap space for all hours worked in extravagance of 40 hours but short than 50 hours, and triple space for any hours worked aggravate 50 hours. The program should be cogent to loop and input the employee's designate, hours worked, and the blame of pay.  Once this has been produced then outputthis notice including the bulk pay in the fashion of a paycheck.The order starts all aggravate intermittently until you input an feeble blame of pay or hours worked.  Thismeans a indirect blame of pay or indirect reckon of hours worked isnot gratifying. Imprint it out relish an real payobstruct delay Englishlanguage representing the obstruct sum.Prinout relish a guild Payobstruct delay fashionat:     Company     Address     Name: Amount: numerical     Amount:    English of numerical prize     Signature Line: