Consider a distributed system consisting of n processes and m resources in which processes are using or request model to submit resource requests. prove or disprove: the rag (resource allocation graph) can contain at most min{ n/2, m/2} distinct deadlocks.

do not use any of these common illegal characters/symbols:

# pound

% percent

& ampersand

{ left curly bracket

} right curly bracket

\ back slash

< left angle bracket

> right angle bracket

* asterisk

? question mark

/ forward slash

  blank spaces

$ dollar sign

! exclamation point

' single quotes

" double quotes

: colon

@ at sign