Company: Amazon_july
Difficulty: medium
Maximum Valid Pairs Problem Description An AWS client wants to deploy multiple applications and needs two servers, one for their frontend and another for their backend. They have a list of integers representing the quality of servers in terms of availability. The client's preference is that the availability of an application's frontend server must be greater than that of its backend server. Two arrays of same size s , frontend[s] and backend[s] where elements represent the quality of the servers, create pairs of elements (frontend[i], backend[j]) such that frontend[i] > backend[j] in each pair. Each element from an array can be picked only once to form a pair. Find the maximum number pairs that can be formed. Function Description Complete the function getMaximumPairs in the editor below. getMaximumPairs has the following parameters: int frontend[s] : frontend server qualities int backend[s] : backend server qualities Returns: </p