Get Max Traffic Time

Problem Statement

Get Max Traffic Time Problem Description In a client-server architecture with N clients and one server, each client starts interacting with the server at a specific time and stops at a specific time. The maximum traffic time is defined as the highest number of concurrent interactions with the server. Determine the earliest time when the maximum number of clients are interacting with the server. Note: The endpoint is also included in the interaction. Complete the function getMaxTrafficTime in the editor with the following parameters: int start[n] : interaction start times int stop[n] : interaction stop times Returns: int : the earliest time of maximum concurrent interactions Examples Example 1: Suppose Input: start = [1, 6, 2, 9] and stop = [8, 7, 6, 10] The interaction timeline would be: Time | Connection | Active Clients -----|---------------------|--------------- 1 | Client 1 joined | 1 2 | Client 3 joined | 1, 3 3 | | 1, 3 4 | | 1, 3 5 | | 1, 3 6 | Client 2 joined | 1, 2, 3 7 | Clie