Design a program to compare the performance of different searching algorithms, such as Linear Search and Binary Search, on various input sizes. Follow the steps below:Create two arrays, A$1$ and A$2,$ where A$1$ has $25$ elements and A$2$ has $100$ elements.Populate the two arrays randomly with values ranging from $0$ to $200.$Perform a search operation for each search algorithm using the two arrays for four different values of your choice.Maintain counters to track the number of comparisons performed and the number of times the comparison operation was true for each search algorithm.Display the results of the counters in the form of a table:Linear SearchA$1$Binary SearchA$1$Linear SearchA$2$Binary SearchA$2$search $1$counter $1$:counter $2$:counter $1$:counter $2$:counter $1$:counter $2$:counter $1$:counter $2$:search $2$counter $1$:counter $2$:counter $1$:counter $2$:counter $1$:counter $2$:counter $1$:counter $2$:search $3$counter $1$:counter $2$:counter $1$:counter $2$:counter $1$:counter $2$:counter $1$:counter $2$:search $4$counter $1$:counter $2$:counter $1$:counter $2$:counter $1$:counter $2$:counter $1$:counter $2$: Draw conclusions based on your observations about the collected data.