Use Flowgorithm to write the program for the following example $.$ Then print out the flow chart

int main$()$

$\{$

int $n,i$;

double A$[100],$ max;

cout

input n $(1-100)?"$;

cin $$ n;

max$=-1000$;

for$(A[i](A[i]>$max$)max=A[i]$;$<mtext\; id="EditorElement\_222370"></mtext><mi\; id="EditorElement\_222371">A</mi><mi\; id="EditorElement\_222375">[</mi><mi\; id="EditorElement\_222374">i</mi><mi\; id="EditorElement\_222376">]</mi>$;

$if(A[i]>$max$)$

max$=A[i]$;