Consider table expansion where the table always has size j for some integer j. We replace a table of size j2 with a table of size G +1)2 whenever the table is full. (For instance, a table with size 5 -25 is expanded to size 62 = 36, A table with size 62-36 is expanded to size 72-49.) Each insertion without table expansion takes 0(1) time. Table expansion takes cj2 time where j is the size of the table begin replaced. The table initially has size 2- 4 Determine the TOTAL running time of n insertions into an empty table. (Note that the final table size will be bounded by (IVa) (Vn 1-n+2vn +1.) Justify your