1. Create ‘n’ nodes singly linked list to store unique random values in the range 0 to 100. Also, store node position in every node of the linked list. (For example, to generate unique random numbers, we can use an integer array of size (101) as status array that initializes with 0. The status array can be used to check the status of a random number whether that number has previously occurred or not. For every random number generation, we can use that random number as an index in the status array, if that element of status array is zero then that random number is unique and is being used to store in the linked list, otherwise try for next random number.) 2. Sort the unique values of the linked list in ascending order using bubble sort. 3. Find the middle node of the linked list. (Note that in the case of an even number of nodes in the Linked List, there will be two middle nodes. In that case, we need to print the first middle element.) 4. Finally, generate a random number within the range 0 to 100, consider that number as key and check whether key is present in the list. If key is not present then print output “Key does not find in the list”, otherwise print node number in which key matched.