Question

A non-empty array A consisting of N numeric values is given.
The product of quadruplet (P, Q, R, S) equates to A[P] * A[Q] * A[R]
* A[S]
(O SP<Q<R<S<N).
For example, array A such that:
A[1] = 1
A[2] = 2
A[O] = -3
A[6] = 1
A[3] = -2
A[4] = 5
A[5] = 6
• (0, 1, 2, 3), product is -3* 1 * 2*-2 = 12
. (1, 2, 4, 5), product is 1*2*5*6 = 30
• (2, 4, 5, 6), product is 2*5*6*1 = 60
60 is the product of quadruple (2 4 5 1) which. is the maximal.
your goal is to find the maximum product of any quadruple for input arrayA[].
write an efficient algorithm for the following assumptions​

Answer 1

sorry for disturbing

mark my answer as brainliest