Considering the pseudocode represented in Algorithm 1, a possible solution for the problem would be the use of release mechanisms, which are explained as follows. If a philosopher cannot pick the second fork, he/she immediately releases all locked forks. Rewrite the pseudocode to represent such a solution. Would this solution work correctly? Explain fully.

Algorithm 1: Execution function of a single philoso- pher Data: philosopherK; Result: ; // the philosopher ID // no return value 1 run( philosopherK) 2 think 3 | pick-left-fork(); pick_right _fork): 5 eat( 6 releaseleftfork0; 7 release_right fork)