<prompt> Andika suluhisho la tatizo lifuatalo katika C : Kwa kuwa idadi kamili ni nums, kupata namba tatu ambao bidhaa ni upeo na kurudi bidhaa upeo.  <response>: int maximumProductvector nums int n nums.size; Sort the array sortnums.begin, nums.end; Maximum of product of the last three elements or the first two elements and the last element return maxnumsn-1numsn-2numsn-3, nums0nums1numsn-1;This code sorts the array and returns the maximum of either the product of the last three elements or the product of the first two and the last element. 