Assume that you are creating an array data structure that has a fixed size of n. You want to backup and empty this array after every n insertion operations. Unfortunately, the backup operation is quite expensive, it takes n time to do the backup. Insertions without a backup just take 1 time unit. Show that you can do backups in O(1) amortized time.

Use the potential method for your proof. Explain in sufficient detail.