Si resources for pi
imagining worst case such that all processes are allocated all the available resources but are deadlocked i.e allocate Si-1 to process pi
so to avoid deadlock
$\sum_{i=1}^{i=n}$ (Si-1) < m m= available resources
$\sum_{i=1}^{i=n}$ Si < m + n
$\sum_{i=1}^{i=n}$ Si < 7+10
$\sum_{i=1}^{i=n}$ Si < 17
$\sum_{i=1}^{i=n}$ Si <= 16
so maximum 16