The implementation of insert function is not efficient because when a resize occurs, the resize operation takes time to copy all the elements from an old array to a new array, and then the subsequent loop in the body of insert shifts many of those elements. Give an implementation for the function insert_new, so that, in the case of a resize, the elements are shifted into their final position during that operation, thereby avoiding the subsequent shifting. Hint You are going to need two (non-nested) loops