For an unbounded array, if the array size is doubled when the array becomes full for an operation insert the amortized cost per insert is o(1) that is basically constant. Jon claims that this consumes too much space. He wants to try to increase the size with every insert by just two over the previous size. What is the amortized cost per insertion in Jon's table? Note: The cost is considered only for the number of copy to do for resizing and not for an insert when space is available.