Code java optimize Consider the following:

A non$-$empty array, inarr of strings containing only lowercase alphabets

Am $2$ matrix of integers inmatrix $\backslash$table$[["$pip$",\{2,19\},2,\text{'}p\text{'},\text{'}$s$\text{'},$"sis'$]]$

The number of consonants in each of the replaced elements are:

$\backslash$table$[[$inarr$($after replacement$),$# of consonants,outstr$],["$apple$",3,$"guava"$],["$guava$",2,],["$pomegranate$",6,],["$sis$",2,]]$

$1$ Ingort jave.util. $.$

$2$

$3$ ciass midede

$41$

$5$

$6$

$7$

$8$

$9$

System.out

$10$

$11$such that:

the size of inarr is equal to $m$

the elements of inarr and the rows of inmatrix have oneto$-$one correspondence

each row of integers vec$(i)$ and vec$(j)\text{'}$ of inmatrix would be such that

$.i$ is always less than the length of the corresponding string in inarr

$\text{'}j\text{'}$ would always be less than $26$inarr:

"apphe"

"goava"

"pomegranate"

"pip"

inmatrix:

$3$

$1$

$8$

$2$

$1$

import

java.util.

$2$

$3$

class mivCode

$4$

$5$

$6$

$7$

$8$

$9$

$10$

$11$

$0$

$181+\frac{1}{20}$

$8$

$20$

$8$

$0$

$2$

$18$

Perform the following operations:

For each string str in inarr and corresponding row of integers $\text{'}i\text{'}$ and $$ of inmatrix, replace all the occurrences of the character at $\text{'}i\text{'}$th index in str with the $\text{'}j\text{'}$th element in the alphabet series Note: alphabet series $-\text{'}a\text{'}$ would be the $0^{th}$ element and $\text{'}z\text{'}$ would be the ${25}^{th}$ element

Starting from leftmost replaced string from inarr, identify the first string with the minimum number of consonants and assignStarting from leftmost replaced string from inarr, identify the first string with the minimum number of consonants and assign it to outStr

Print outStr

Input Format:

First line contains inarr, with the elements separated by :$\text{'}\text{'}($comma$)$

Second line will contain number of rows $m$ of inmatrix

The next $m$ lines will contain the elements of inmatrix. Each line will have $2$ elements separated by space.

Read the inputs from the standard input stream.

Output Format:Output Format:

Print outstr to the standard output stream

Sample inputs and outputs:

Sample Input:

apphe,goava,pomegranate, pip

$4$

$31112080218$

Sample Output:

guava

Explanation:

$1.$

i

java.util.:

$2$

$3$

class

UCode

$4$

$5$

$6$

$7$

$8$

$9$

$10$

$11$

public stataic

$\{$

$2.2?$xplanation:

$\backslash$table$[[\backslash$table$[[$inarr$($initial$],[$value$)]],$inmatrix values,$\backslash$table$[[$value at$],[$index$],[$inmatrix$],[[$j$]]],\backslash$table$[[$character$],[$in$],[$inarr to$],[$be$],[$replaced$]],\backslash$table$[[$character$],[$to be$],[$replaced$]],\backslash$table$[[$inarr$($after$],[$replacemer$]]],["$apphe$",\{3,11\},3,\text{'}h\text{'},$I,"apple"$],["$goava$",\{1,20\},1,\text{'}$o$\text{'},\text{'}{?}^{\text{'}},$"guava"$],[$oomegranate$",\{8,0\},8,{?}^{\text{'}}a\text{'},\text{'}$a$\text{'},$pomegrana$],["",\{2,19\},2,\text{'}$p$\text{'},\text{'}$s$\text{'},$sis"$]]$

$1$ import java.uti$1."$; $2$

$3$

c$.$luss

m$.$Code

$4$

$5$

$6$

$7$

$8$

$9$

System.out. P

$10$

publif statie void

$11\}$

$$e number of consonants in each of the replaced elements are: