#!/bin/bash
echo "enter no.of resources: "
  read n1 
  echo -n "enter the max no .of resources for each type:  " 
  
  for(( i=0; i <$n1; i++ ))
  do 
    read ${t[${b}][${i}]} 
  done
  echo -n "enter no .of process: " ​
  read p 
  echo -n "enter allocation resources: " 
  for((i=0;i<p;i++)) 
  do 
   f[i]=0 
   for((j=0;j<$n1;j++)) 
   do
    read ${a1[${i}][${j}]} 
   done
  done
  for((i=0;i<$p;i++))
  do 
    for((j=0;j<$n1;j++)) 
    do
       if [ ${a1[${i}][${j}]} -le ${t[${b}][${j}]} ] 
        then
        ${t[${b}][${j}]} += ${a1[${i}][${j}]} 
       else 
        echo -n "wrong resources allocation"
       fi
    done
  done
  echo -n "chance of deadlock occurrence after allocation" 
  for((j=0;j<$n1;j++)) 
   do
    echo -n "${a1[${b}][${j}]}" 
   done
  echo -n "enter the max resources for every process"
  for((i=0;i<$p;i++))
  do 
    for((j=0;j<$n1;j++)) 
      do 
      read ${max[${i}][${j}]} 
      ${n[${i}][${j}]}=${max[${i}][${j}]}-${a1[${i}][${j}]} 
      done
   j=0
   echo -n "needed resources for every process to start execution"
  done 
  for((i=0;i<$p;i++))
  do 
   echo -n "${n[${i}][${j}]} , ${n[${i}][${j+1}]} , ${n[${i}][${j+2}]}" 
   echo -n "safe sequence the sequence of process to compute their execution" 
  done
  for ((a=0;a<$p-c;))
  do 
     for ((i=0;i<$p;i++)) 
     do 
      j=0 
      b=0
      if [${f[${i}]} -eq 0] 
       then 
         if [ ${n[${i}][${j}]} -le ${a1[${b}][${j}]} &&
              ${n[${i}][${j+1}]} -le ${a1[${b}][${j+1}]} && 
              ${n[${i}][${j+2}]} -le ${a1[${b}][${j+2}]} ]
            then
              echo -n "process %d execution started and completed,i+1" 
            for((k=0;k<$n-1;k++)) 
            do
              ${a1[${b}][${k}]}+=${a1[${i}][${k}]}
                ${f[${i}]}="1"
                
            done
         else 
         ${f[${i}]}="0"
      fi 
     done
  done