(20 points) Given an array {ai, a2 , an. a reverse is a pair (ai,aj such that i j but a, > aj. Design a divide-and-conquer algorithm with a runtime of O(n logn) for computing the number of reverses in the array. Your solution to this question needs to include both a written explanation and a Python implementation of your algorithm, includin g: (a) Explain how your algorithm works, including pseudocode (b) Implement your algorithm in Python (c) Randomly generate an array of 100 numbers and use it as input to run your code. Report on both the input to your code and on how the output demonstrates the correctness of your algorithnm (20 points) Given an array {ai, a2 , an. a reverse is a pair (ai,aj such that i j but a, > aj. Design a divide-and-conquer algorithm with a runtime of O(n logn) for computing the number of reverses in the array. Your solution to this question needs to include both a written explanation and a Python implementation of your algorithm, includin g: (a) Explain how your algorithm works, including pseudocode (b) Implement your algorithm in Python (c) Randomly generate an array of 100 numbers and use it as input to run your code. Report on both the input to your code and on how the output demonstrates the correctness of your algorithnm