I want its code in cpp without using any external libraries

Get 3 different data arrays (of size 1000 ) and insert them into a hash table. Compare linear probing, linked list chaining, and BST chaining in terms of searching (search at least 100 times in each case). Data- 1:3,5,61,19,13,23,29,17,7,11 (all prime numbers (1000 numbers), should not be consecutive) Data-2: 25,65,21,91,33,15,27,35,55 (all odd numbers (1000 numbers), should not be consecutive) Data-3: 70,50,60,90,100,32,50,40,12 (all even numbers (1000 numbers), should not be consecutive) a) Insert Data-1 using linear probing, linked-list chaining, and BST chaining. Search different randomly generated 100 numbers for each case. Show the average and the total number of searches that you performed for searching 100 numbers for every case. b) Insert Data-2 using linear probing, linked-list chaining, and BST chaining. Search different randomly generated 100 numbers for each case. Show the average and the total number of searches that you performed for searching 100 numbers for every case. c) Insert Data-3 using linear probing, linked-list chaining, and BST chaining. Search different randomly generated 100 numbers for each case. Show the average and the total number of searches that you performed for searching 100 numbers for every case