There are N clients who have ordered N handmade items. The K$-$th client ordered exactly one item that takes TIK$]$ hours to make. There is only one employee who makes items for clients, and they work in the following manner: spend one hour making the first item; if the item is finished, the employee delivers it to the client immediately;if the item is not finished, they put it after the N$-$th item for further work; the employee starts making the next item.For example for T $=[3,1,2],$ the employee spends $6$ hours making items inthe following order: $[1,2,3,1,3,11.$ The first client waited $6$ hours for their item, the second client received their item after $2$ hours and the third client after $5$ hours. What is the total time that clients need to wait for all ordereditems? For the above example, the answer is $6+2+5=13$As the result may be large, return its last nine digits without leading zeros $($in other words, return the result modulo $10\backslash$deg $).$Write a function:class Solution i public int solution $($intll T$)$; $\}$