Read file "process. Txt". File contains data of the format Process_Name Priority_Level Entry_Time P1 10 13.43.41 Build a linked list to implement a specialized queue i. E. Priority Queue. The priority (1 to 10, 1 lowest and 10 highest) of the process will be according to given priority_level but if two processes with the same priority_level exist in the queue then the process with least entry time will exit first. User should be given choice to whether enter a new process into the queue or dequeue existing process. You may use structure "struct time" for getting system time.

Given a link with a maximum transmission rate of 32.8 mbps. only two computers, x and y, wish to transmit starting at time t = 0 seconds. computer x sends filex (4 mib) and computer y sends filey (244 kib), both starting at time t = 0. statistical multiplexing is used, with details as follows packet payload size = 1000 bytes packet header size = 24 bytes (overhead) ignore processing and queueing delays assume partial packets (packets consisting of less than 1000 bytes of data) are padded so that they are the same size as full packets. assume continuous alternating-packet transmission. computer x gets the transmission medium first. at what time (t = ? ) would filey finish transmitting? give answer in milliseconds, without units, and round to one decimal places (e.g. for an answer of 0.013777 seconds you would enter "13.8" without the quotes)