An allocation A $=($A$1,...,$ An$)$ is called $\backslash$alpha $-$EFX if vi$($Ai$)>=\backslash$alpha $$vi$($Aj $\backslash$g$),$g in Aj$,$i$,$j $.$

Design an algorithm to obtain $21-$EFX allocation when agents have monotone subadditive valu$-$ ations,wherev$($S$\backslash$cup T$)<=$v$($S$)+$v$($T$),$S$,$T $$M andv$($S$)<=$v$($T$),$S$$T $$M$.$