Question 23

Problem Statement

Question 23 Problem Description You are given a logging system with a circular buffer that can hold up to bufferCapacity logs. Each log has a unique timestamp logTimestamp[i] (in milliseconds) and a tag logTag[i] . When a new log arrives, the system: transmits all logs sharing the same tag as the new log, but only if they fall within a specific time window ( transmissionWindow ). if the buffer is full, it removes the oldest log to make space for the new one. Implement a function that finds the total number of logs transmitted throughout the process as logs arrive. The function getTotalTransmittedLogs takes the following parameters: int logTimestamp[] : the recording times of logs in milliseconds string logTag[] : the tags of logs int bufferCapacity : the capacity of the circular buffer int transmissionWindow : the time range (in milliseconds) within which logs sharing the same tag as the arriving log are transmitted The function should return the number of logs transmitted during the p