Show how the following pseudo code could be modified to avoid deadlock. Explain your answer. Shared Variables: lockA, lockB, resourceA, resourceB Process1 { aquire(lockA); aquire(lockB); modify(resourceA); modify(resourceB); release(lockB); release(lockA); } Process2 { aquire(lockB); aquire(lockA); modify(resourceB); modify(resourceA); release(lockA); release(lockB); }