In Java. Ask the user for a starting point and ending point. Sort the user list using the method in the previous question, but only display the users within the entered range. I already have a code, but it doesn't sort right. I believe there is something wrong.

Here is the data text. I can't copy and paste it because it is too long. https://textuploader.com/t1ol7

The image without the red highlight should be the correct output.

Code:

import java.io.File;
import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Scanner;
public class Users
{
public static void main(String[] args){
String filename = "user-database.txt";
Scanner infile = null;
try {
infile = new Scanner(new File(filename));
} catch (FileNotFoundException e) {
System.out.println(e.getMessage());
}
ArrayList usernames = new ArrayList();
ArrayList passwords = new ArrayList();
int start, end;
Scanner input = new Scanner(System.in);

System.out.println("Enter a starting point and ending point");
start = input.nextInt();
end = input.nextInt();

infile.nextLine();

while(infile.hasNext()){
usernames.add(infile.next());
passwords.add(infile.next());

}
infile.close();

int minIdx;
String temp;
for(int i = 0; i < passwords.size();i++){
minIdx = i;
for(int j = i+1; j < passwords.size(); j++){
if(passwords.get(j).compareToIgnoreCase(passwords.get(minIdx)) < 0)
minIdx = j;
}

temp = passwords.get(i);
passwords.set(i, passwords.get(minIdx));
passwords.set(minIdx, temp);

temp = usernames.get(i);
usernames.set(i, usernames.get(minIdx));
usernames.set(minIdx, temp);
}
for(int i = start; i < usernames.size() && i < end; i++)
System.out.printf("%20s %20s\n", passwords.get(i), usernames.get(i));
}
}

Question

In Java. Ask the user for a starting point and ending point. Sort the user list using the method in the previous question, but only display the users within the entered range. I already have a code, but it doesn't sort right. I believe there is something wrong.  Here is the data text. I can't copy and paste it because it is too long. https://textuploader.com/t1ol7The image without the red highlight should be the correct output.Code:import java.io.File;import java.io.FileNotFoundException;import java.util.ArrayList;import java.util.Scanner;public class Users{public static void main(String[] args){String filename = &#34;user-database.txt&#34;;Scanner infile = null;try {infile = new Scanner(new File(filename));} catch (FileNotFoundException e) {System.out.println(e.getMessage());}ArrayList usernames = new ArrayList();ArrayList passwords = new ArrayList();int start, end;Scanner input = new Scanner(System.in);System.out.println(&#34;Enter a starting point and ending point&#34;);start = input.nextInt();end = input.nextInt();infile.nextLine();while(infile.hasNext()){usernames.add(infile.next());passwords.add(infile.next());}infile.close();int minIdx;String temp;for(int i = 0; i < passwords.size();i++){minIdx = i;for(int j = i+1; j < passwords.size(); j++){if(passwords.get(j).compareToIgnoreCase(passwords.get(minIdx)) < 0)minIdx = j;}temp = passwords.get(i);passwords.set(i, passwords.get(minIdx));passwords.set(minIdx, temp);temp = usernames.get(i);usernames.set(i, usernames.get(minIdx));usernames.set(minIdx, temp);}for(int i = start; i < usernames.size() && i < end; i++)System.out.printf(&#34;%20s %20s
&#34;, passwords.get(i), usernames.get(i));}} Ask the user for a starting point and ending point. Sort the user list using the method on the previous question but onlTest Case 1 Falled Show what's missingEnter a starting point and ending point
O 3ENTER03EİVQZXDA05CQW2HbejgEOEP0CFQfspaldingem Anacarwithim5d 
qgumlyq3 
Test Case 2 Falled Show what's missingEnter a starting point and ending point 
O 10 ENTER03EİVQZXDA05CQW2HbejgEØE P0CFQfspaldingem 
acarwithim5d 
qgumlyq3 
nmckie2w
zarnefieldam 
rhutchines 
fkeoghanjz 
mrutigliano5r
kfairchild8p
slaverock30
ØFVynoØh8Q9YUY9Øk750fqrj5eOP55sxsØr1Hkgaq6xBwØsug8D4øtfzt1Test Case 3 FalledShow what's missingEnter a starting point and ending point 
10 30 ENTERmrallings9b
jryallq
rchallenorlg 
mieldeng9 
mdudlestonb6 
pcowenq2 
mphlippibp 
ocaughandt 
nbindon71
ckupperce
cgurradok3 
arawcliffja
cdarteran 
cguitel3y
zrodderp
dbrighamdc 
balgaterl
dmetzelos 
tlyffe5s 
mgolderol 
ØVGFGLW8L64TØWYSkh3mØx420432EØYhBkYQad5jØYZJIKI2RS815TUF95619J0sob19WZBAHFXCG1BhokzCb1CIgzsFUR1h161gozQ1j3deRzE41JcCDpdV1Joqx1Zi6ovv1NJDHPKYZ101QZP9K7SV9B1uQGHD9a1vCqgfn31VJ5GYXT1WUBPJREFSYTest Case 4 Falled Show what's missing C Test Case 1 Falled Show what's missingEnter a starting point and ending point
O 3 ENTERnmckie2w
]slaverock30 
csidsaffks 
OFVynoOtfzt124iDoXTest Case 2 Falled Show what's missingEnter a starting point and ending point 
0 10ΕNTEnmckie2w
slaverock30
csidsaffks 
cdewsr4|
scharnick7y 
egeane5y 
dbellie6y
bpfaffelm9
bsilver9f
kdossantose1
OFVynoøtfzt124iDoX2bq4TN2qywQ72YNPLE2zSD6b3Hqa6U3rEDDI4iFm02Test Case 3 Falled Show what's missingEnter a starting point and ending point 
10 30 ENTERskristoffersen4q[
]gdagleas2g 
1commuzzoog 
ckeatleyqv 
gmcrannellgm
askilleno1 
ploomis8w
krollinsonro 
beagleton70 
4y55b15mvd0B5UGUSP6Li0xh6qzb616SipcG6UBR8S75охх07MKYR4wself13 
sgudyer9d 
Cwallentinl7 
1fortnam97 
jhuardbj 
groberdsx 
esutty9j 
cputtonav
1breese3d 
sslyfordei 
echetwynd5m 
7r91t87tK18099Uolo9ilTKz9PBCN99RiøYaAiMpbuaqyvIAAгохомAvamJHTest Case 4 FalledShow what's missing

Accepted Answer

Find the modified code in step 2