I need the solution for question number 5 which is cooding part in Java

Problem Design a machine selling thue types of drinks d1, o2, 63 and thivee types of as ,2 e buyers can use lour types of coins cl once from the machine s nl, n2, suppose that there are places in the machine for inserting coins selecting the type of the drinks or snacks, and picking the number of the drink or stack. At the end, the buyer r has to pash a button S for machine to start the process. A buyer has to follow the designed order to buy the drinks or snacks, eg, first insert coins, then select the type of drinks or snacks, then pick the some part/parts can be repeated Design the machine with the following stages drink or snack that the buyer selected, and finally push the button S to start the process (1) Suppose that 2-1d1, d2, d3, si, sa c. c2, ca c4, n1. n2) Design the regular expression r such Ltr) is the language which contains the strings that buyers enter the machine 3) (n,+ni) 4 (2) Design an NFA which accept the language L(r)