What is the amortized running time of an operation in a series ofn add operations on an initially empty extendable table implemented with an array such that the capacitylncrement parameter is always maintained to be l1og(m+ L)], where m is the number of elements of the stack? That is, each time the table is expanded by l1og(m+ 1)l cells, its capacitylncrement is reset to l1og(m'+ l)l cells, where m is the old size of the table and m' is the new size (in terms of actual elements present).