@Shaik Masthan sir, i think the answer for B will be YES.
I think graph can be converted to a concurrent program as follows.
par-begin
s1
s2
par-end
begin
s3
s4
s5
s6
end
Sir for concurrency it is not necessary that each and every operation must be concurrent, but all the dependencies must be preserved and no new dependency must appear,
Our question is an easy version of
source: http://uclab.khu.ac.kr/lectures/2006_1_os/lecture3-concurrent-process.pdf
Ignore the GATE question’s s1 and s2. (which won’t change the dependencies of the subsequent subtree)
And ignore s5 and s3 from the diagram i have posted above.
Now compare both of them, they are equivalent.