Assume the Dining Philosophers problem, as represented in the pseudocode below FOR THE BELOW QUESTION

run( philosopherK ) {

think();

pick_left_fork();

pick_right_fork();

eat();

release_left_fork();

release_right_fork();

}

Considering the pseudocode in the beginning of this question, a possible solution for the problem would be the use of release mechanisms. 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.

PLEASE EXPLAIN FULLY!!!!