Show that if the sequence of items to be considered is 1/2,1/2n, 1/2,1/2n,,1/2 (totally 4n1 items), then the NF algorithm will indeed use nearly twice the number of bins that are really required