ECEN 449: Microprocessor System DesignDepartment of Electrical and Computer EngineeringTexas A&M UniversityAssignment #3Due Friday, November 09, 20071. [15 points.]For the following set of tasks show how different scheduling algorithms will schedule the tasks. Eachtask is specified by a triple (arrival time a, deadline time d, length of task l). The tasks are: A(0, 10,5), B(0, 8, 3), C(2, 12, 4), D(3, 18, 5), E(4, 18, 1).(a) Round Robin scheduling, where each task is given 1 time unit each time it is scheduled(b) Round Robin scheduling where each task is run to its completion(c) Earliest deadline first scheduling(d) First come first serve scheduling.Show a timeline of what tasks are executed in each time unit for each policy. If there are two taskseligible for scheduling at the same time (under a given policy), assume the tasks are scheduled inalphabetical order.2. [15 points.]Assume a context switch in a system costs about 100us. What is the maximum number of interruptsthe system can handle? Based on these results, can you think of a way to stage a Denial of Serviceattack on such a system if it acts as a web server?3. [10 points.]Consider a PCM communication paradigm. We want to be able to sample the input at 8K samples/sec(a reasonable choice for voice signals). Also, we want each sample to be at least 8bits.(a) What is the maximum period for the PCM signal?12Assignment #3(b) What would the maximum period be in case I want to multiplex 12 such PCM datastreams intoa single PCM signal?October 27, 2007 A. L. Narasimha Reddy and Sunil P Khatri ECEN