Optimal way ( less than O(n^2) ) to check for number of triplets where a[k]<a[

Question

I\'m solving a problem where I have to find number of triplets of Ai, Aj, and Ak such that Ak < Ai < Aj and i < j < k in an array . I know the time complexity O(