Solve it using the code below:

package edu.njit.cs$114$;

import java.util.Arrays;

$/**$

$*$ Author:

$*$ Date created:

$*/$

public class ArrayStudy $\{$

public static double $[][]$ manipulate$($double $[][]$ a$,$ double fraction$)\{$

$//$ Perform step $($a$)$

double $[][]$ a$1=$ extract$($a$,$ fraction$)$;

System.out.println$("$Content of array after step $($a$)$ for fraction $"+$ fraction $+"$ :$")$;

printArray$($a$1)$;

$//$ Perform stp $($b$)$

double $[][]$ a$2=$ replace$($a$1)$;

System.out.println$("$Content of array after step $($b$)$ for fraction $"+$ fraction $+"$ :$")$;

printArray$($a$2)$;

return a$2$;

$\}$

$//$ prints $2$D array

private static void printArray$($double $[][]$ a$)\{$

for $($int i$=0$; i$<$ a$.$length; i$++)\{$

for $($int j$=0$; j$<$ a$[$i$].$length;j$++)\{$

System.out.print$($String$.$format$("\%\mathrm{.}2$f$",$a$[$i$][$j$])+",")$;

$\}$

System.out.println$()$;

$\}$

$\}$

private static double $[][]$ extract $($double $[][]$ a$,$ double fraction$)\{$

if $($a$.$length $==0)\{$

return a;

$\}$

int fractionNumCols $=0$;

int noOfNegativesInRow $=0$;

int noOfRowsRemoved $=0$;

boolean $[]$ removeRow $=$ new boolean$[$a$.$length$]$;

$//$ Loop through each row of a to check if number of negatives is at least halfCol

for $($int i $=0$; i $<$ a$.$length; i$++)\{$

fractionNumCols $=($int$)$ Math.ceil$($a$[$i$].$length $*$ fraction$)$;

noOfNegativesInRow $=0$;

$/**$

$*$ To be completed

$*$ Loop through each column of the i$-$th row to update noOfNegativesInRow

$*$ If noOfNegativesInRow is at least fractionNumCols, set removeRow$[$i$]$ to true

$*$ and also update noOfRowsRemoved

$*/$

$\}$

$//$ allocate a new array

double $[][]$ b $=$ new double$[$a$.$length$-$noOfRowsRemoved$][]$;

int validRowIndex $=0$;

$/**$

$*$ To be completed

$*$ Loop through each row i of a and if removeRow$[$i$]$ is false, add it to b

$*$ using Arrays.copyOf$()$ function

$*/$

return b;

$\}$

private static double $[][]$ replace$($double $[][]$ b$)\{$

double columnSum $=0\mathrm{.}0$; $//$Column sum

double columnAverage $=0\mathrm{.}0$;$//$Column average

int numNonNegatives $=0$; $//$ number of positives in the column

$//$Loop through each column j to replace negative with average of positives in the same column

for $($int j$=0$; j $<$ b$[0].$length; j$++)\{$

columnSum $=0\mathrm{.}0$;

numNonNegatives $=0$;

$/**$

$*$ To be completed

$*$ First find columnSum and numNonNegatives using non$-$negative values of

$*$ the j$-$th column of b$.$

$*$ This is done by looping through each row of the same column

$*/$

columnAverage$=$ numNonNegatives $>0?$ columnSum$/$numNonNegatives : $0$;

$/**$

$*$ To be completed

$*$ Now replace all negative numbers of j$-$th column of b with the column average

$*/$

$\}$

return b;

$\}$

$//-----------------------------------------------------------------$

$//$

$//-----------------------------------------------------------------$

public static void main $($String$[]$ args$)\{$

double $[][]$ a $=\{\{-1,4,3,2,-3,2\},\{-2,3,5,-4,0,1\},\{-1,-3,-4,1,-1,0\},\{-1,2,-3,6,5,3\},\{-3,2,-3,-5,0,0\}\}$; $//$A $5$ x $6$ Dimension;

System.out.println$("$Printing input array..."$)$;

printArray$($a$)$;

double $[][]$ b $=$ manipulate$($a$,0\mathrm{.}5)$;

b $=$ manipulate$($a$,0\mathrm{.}6)$;

System.out.println$("$Printing original array..."$)$;

printArray$($a$)$;

$\}$

$\}$