5.Consider a control system with the following loop transfer function
-∞≤K≤∞
(b) Suppose that the Nyquist plot ( K >0) you obtained in part (a) is depicted in Fig. 2, where the
solid line is part of the Nyquist plot when ω is from ∞ ⁺ to 0⁺, and it has an intersection with axis
-Re(L(s)) at -K.
Using Nyquist criterion, determine the range of K > 0 such that the closed-loop system can be stabilized.
If the system is unstable due to the range of K, find the number of closed-loop pole(s) in the right-half of
s-plane.
For problems 32 to 35, please consider a graph with /VI vertices and |E] edges, to which the Dijkstra algorithm is applied to find the shortest path. Assume |E| is both O(|V|2) and Ω(|V|).
33. If Dijkstra algorithm is implemented with Fibonacci heap as priority queue, then the complexity is
(A) O(|V|2+|E| log |V|)
(B) O(|V|2)
(C) O(|E| log|V|)
(D) O(|E|+I|V| log(|V|)
(E) O(|E|)