Usin Java $-$ Implement a post$-$office case where a clerk can serve $2$ customers in a row each time $($i$.$e$.$ arrival of $2$ customers and serve them, arrival next $2$ customers and serve them, and so on$).$ The number of all arrived customers is $10.$

Hint: please use thread and do not consider FCFS