A swapping system eliminates holes by compaction. Assuming a random distribution of many holes and many data

Question:

A swapping system eliminates holes by compaction. Assuming a random of many holes and many data segments and a time to read or write a 32-bit memory word of 4 nsec, about how long does it take to compact 4 GB? For simplicity, assume that word 0 is part of a hole and that the highest word in memory contains valid data.
Distribution
The word "distribution" has several meanings in the financial world, most of them pertaining to the payment of assets from a fund, account, or individual security to an investor or beneficiary. Retirement account distributions are among the most...