Suppose Shortest Processing Time (STP) rule is being used in a dynamic scheduling problem. There are four jobs A,B,C,D ready to be processed at present time. The processing times for the five jobs are 5,7,9 and 3 days respectively. A new job E will arrive on the 2nd day. The processing time for job E is 4 days. Assume that no other jobs arrive in the system until all jobs (A,B,C,D and E) are completed. What is the sequence of processing these 5 jobs?