Please assist me with this Optimal chain matrix multiplication algorithm problem. Thank you for your time.

isport java.util.Scanner : publie class optMatrixChaintult publie static final int effectiveInfinity - 99999 public static void printoptimalParens (int s[1 inti ,int j it j System.out.print(4) else System.out.print("(") PrintOptima1Parens (s , i,s[i][j]) ; printoptimalParens (s,s[i I1+1,j) System.out.print)" publie statie void main Scanner keyboard - new Scanner System.in i System int N keyboard.nextInt int pll new int [N+1 out.print( "Enter number of matrices in chain: for inti-oi