implement a binary search algorithm and demonstrate how long (on average) it takes for arrays of sizes 10, 100, and 1000. The array's values do not need to be printed out.implement a binary search algorithm and demonstrate how long (on average) it takes for arrays of sizes 10, 100, and 1000. The array's values do not need to be printed out

Given an integer **n**, create a two-dimensional array of size **n×n** according to the following rules and print it: - On the main diagonal put `0`.- On the diagonals adjacent to the main put `1`.- On the next adjacent diagonals put `2`, and so forth. # Example input ```5``` # Example output ```0 1 2 3 41 0 1 2 32 1 0 1 23 2 1 0 14 3 2 1 0```

Don't give me AI generated answer or plagiarised answer. If I see these things I'll give you multiple downvotes and will report immediately.

Implement an empty integer array of capacity 5. a) Use a loop to input values from the console into the array. b) Use a loop to determine the smallest element in the array. c) Use a loop to determine the largest element in the array. d) Use a loop to output the array. e) Output the smallest and largest elements. Example Output [0] = 4 [1] = 24 [2] = 123 [3] = 54 [4] = 3 Array: 4 24 123 54 3 Max: 123 Min: 3   programming language is c++ pleasw do it in a easy way