Write a C++ program that randomly generate 100,000 signed integers up to your computer's data range. Then randomly selects 1000 samples. The program finds the data range of these samples and partitions the data range to N partition (N is a user input). Then each partition i (i in the range [0, N-1]) contains the data has values small than partition i+1. The data range of each partition becomes the index which is used in the following steps. Afterward you need to assign the all 100,000 samples to the N partitions. Then the user can search a particular value (any value in the data range). Such a value should first icheck with the index. Then index is used to direct to the according partition and then check if the value exists. if it does not exist, the value is inserted to that particular partition.