Create a struct of $20$ points with random values of x and y coordinates between $1-10.$ Now create another random point A $($having x and y coordinate between $1-10)$ and use generic linear search to check if A lies in the struct point objects. Use a generic bubblesort to sort $($descending order$)$ all the struct points based on their distance from the origin.