A swapping system eliminates holes by compaction. Assuming a random distribution 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.