Consider table expansion where the table always has size j2 for some integer j. We replace a table of size j2 with a table of size (j 1)2 whenever the table is full. (For instance, a table with size 52 25 is expanded to size 62 36. A table with size 6236 is expanded to size 7249.) Each insertion without table expansion takes ?(1) time. Table expansion takes c)2 time where J2 ?s the size of the table begin replaced. The table initially has ze 224 Determine the TOTAL running time of n insertions into an empty table. (Note that the final table size will be bounded by (IVn (1)2 2Vn1.) Justify your