Consider an M$/$G$/1/5$ system, where jobs arrive with an average inter$-$arrival time of $3$ minutes and are processed with a service time following NORM$(2,5)($in minutes$).$ If a job is rejected from entering the queue, it will attempt to re$-$enter after spending UNIF$(10,20)$ minutes elsewhere. The priority of jobs in the queue is determined primarily by the number of rejections $($i$.$e$.,$ jobs with more rejections have higher priority$).$ In case of a tie, the job that has spent more time in the system is given preference.