Once upon a time, there was a kingdom where math was always a big problem. When the post of the royal treasurer needed to be filled, applicants were presented with the following problem: We have two arrays of integers, A and B. A and B, each contains exactly N elements. You should compute the value of S as follows: S = A0*B0 + + AN-1*BN-1 Write a C++ program to fill the two arrays with random integers, then the program will rearrange the numbers in A in such a way that the value of S is as small as possible. You are not allowed to rearrange the numbers in B. The program should output the values stored in both arrays and the computed value of S. Constraints - A will contain between 1 and 50 elements, inclusive. - A and B will contain the same number of elements. - Each element of A will be between 0 and 100, inclusive. - Each element of B will be between 0 and 100, inclusive.

this is for a project that i have to present infront of my instructors and they also asked for"Discussion about the program (explain the aim behind the program)" and "Discussion about the functions (explain the aim behind each function used in the program)" if i can get the presentation part too it would be great