c$)$ By using the pessimistic locking method, suppose there are two transaction requests

to a MYSQL DBMS$.$ The first transaction inserts a new claim into the system for

TutorID $0582.$ While the second transaction requests to read for the same Tutor$\_$ID's

claim. That is followed by updating claim status to $"$In progress". Illustrates the

locking procedure by using a transaction table $($see below$).$ You can choose the binary

or two$-$phase locking method for illustrating.