Ex2: In a given 3x3 matrix, Write a Java program to find the number which is repetitive and also the print how many times it repeated. Input: 3 X 3 Matrix 121 223 Course: Data Structures Assignment 1 453 Ex1) Write a java program to convert the postfix express to infix expression using stack. Output: The repeated numbers are 1 (2 times), 2 (3 times), 3 (2 times) Algorithm: Ex3: Create a random queue using java array. For example, the queued items are 44, 122,-4, 10,0,99. Now, by using the queue operations such as enqueue and dequeue, do you think sorting is possible? The output should be -4,0, 10, 44, 99, 122. Note: You could use another queue to copy the ordered elements 1. While there are input symbol left ...1.1 Read the next symbol from the input 2. If the symbol is an operand ...2.1 Push it onto the stack 3.Otherwise, ...3.1 the symbol is an operator ...3.2 Pop the top 2 values from the stack. ...3.3 Put the operator, with the values as arguments and form a string. ...3.4 Push the resulted string back to stack. 4.If there is only one value in the stack ...4.1 That value in the stack is the desired infix string. Input : abc++ Output : (a + (b + c)) Input : ab*C+ Output : ((a*b)+c) Input : abc-+de-fg-h+/* Output: (a+b-c)*(d-e)/(f-g+h)