Discuss different types of Two$-$Phase Locking $(2$l$)$ algorithing whin an cample.

Consider the following two trassactions and schedule fitme foes form sop to bottom$),$

$\backslash$table$[[$T$1,$T$2],[$MeadA$,],[$Write A$,]]$

ii$)$ Demonstrate how Two$-$Phase Locking $(2$PL$)$ enpares a conflic$-$terialioble schedule for the transactions mentioned above, using be notasen L$/$aj to that trangaction$/$ releases its lock on $x.$

iii$)$ Illustrate how using locks without $2$PL can result in a schetule that is net conflict$-$serializable.