Database Management Systems $($DBMS$)$ implement transactions by locking and unlocking pages. This means that a thread execution a transaction might have to wait for another thread because the other thread holds a lock on a page that the first thread needs. Given a wait$-$for relationship between threads, give an efficient algorithm $\backslash (\backslash$left$($O$\backslash$left$($n$^\{2\}\backslash$right$)\backslash$right$.\backslash )$ with $\backslash ($ n $\backslash )$ being the number of threads$)$ to find out whether progress can be made or whether one or more of the threads need to be terminated and later restarted.