When multiple tasks are executed on a single threaded CPU, the tasks are scheduled based on the principle of preemption. When a high priority task arrives in the execution queue then the lower priority task is pre empted i$.$e its execution is paused until the higher priority task is completed

There are n functions to be executed on a single threaded CPU With each function having a unique ID between $0$ and n$-1.$ Given an integer n representing the number of functions to be executed and an execution log as an array of strings of size m determine the exclusive times of each of the functionsExclusive time is the sum of execution times for all callls to a functiom. Any string representing an execution log is of the form $($function$\_$id$)$: "start"$/"$end$")$: $($timestamp$),$ indicating that the function with ID $=$Function$\_$id either starts or ends at a time identified by the timestamp value