1) here is no cycle in dependency graph so it is conflict serializable
2) it is 2pl see the graph shared lock taken on A in T1 before releasing the X lock of B and C
3) strict recoverable means if someone write the data other can read and write after commit of that transaction
here $W_{1}\left ( B \right )$ and $R_{3}\left ( B \right )$ making it not strict
4) it not strict 2pl because the X lock of B and C in T1 should be release after T1 commit