To not let any process wait longer than 500 ms, a system developer programs the Round Robin procedure with a dynamic time quantum size. With ‘n’ processes ready, the time quantum Q is set to 500 ms/n. What do you think of this scheduling strategy? (In which situations is this strategy feasible, and when is it not? Are there edge cases?) Explain your reasoning.

Draw a model in BPMN that can produce every possible execution sequence that includes tasks {p, q, r,s, t}. Discuss the fitness and precision of this model with respect to the workflow log {<p, q, r, s, t>,<p, r, q, s, t>}. Draw a process model that would have perfect fitness and perfect precision with respectto this workflow log. Would the alpha-Algorithm produce this model with perfect fitness and precision? (Business 2710 - Modeling and Implementing Business Processes question.)

Which form of process scheduling may be shown to be provably optimal?

please draw the charts!! not just typed answer. Please explain how to do it as well for parts A,B,C,D