Implement a main method that profiles the performance of insert and outputs a

table showing the average time per insert as the length of the array increases.

Pseudocode:

$//$ Setting to allow fine$-$tuning the granularity of the readings

Let NUM$\_$READINGS $=60$

Let INSERTS$\_$PER$\_$READING $=1000$

$//$ Start with an array containing $1$ element

Let array $=$ new array containing one element having value $0$

$//$ Take NUM$\_$READINGS readings

Loop NUM$\_$READINGS times

$//$ Each reading will be taken after INSERTS$\_$PER$\_$READING inserts

Let startTime $=$ current time

Loop INSERTS$\_$PER$\_$READING times

Let index $=$ random integer in range $[0,$ array.length$)$

Let value $=$ random integer value

Let array $=$ Homework$1.$insert$($array$,$ index, value$)$

End Loop

Let stopTime $=$ current time

Let timePerInsert $=($stopTime $$ startTime$)/$ INSERTS$\_$PER$\_$READING

$//$ Output reading in tabular format

Output array length and timePerInsert

End Loop