1:34 b a2. Different operating systems use different file allocation techniques to store files inthe secondary storage device such as HDD. One of the techniques is "Linkedallocation". In this technique, each file is divided into several data blocks of samesize. Each data block has a link to its next block like a singly linked list. So, the datablocks are scattered on the disk. The directory contains a pointer to the starting andthe ending data block of a file. The diagram below depicts a sample linked allocationsystem of a file Abc.txt:Directory entryFileStartEndAbc.txt 100900Data900DataDatablock 1block 2Datablock 3block NWrite a Java program to implement the linked allocation of a given text fileAssgn1_2.txt (uploaded with the assignment) who's each block will containmaximum 50 characters. Read the content of the given file and store it in data blocks(maximum 50 characters per block). Now show a menu that will ask the user toi) add new content at the end of the list,ii) add new content at any position of the list,iii) print the whole content of the list,iv) print the address of the first data block and the total number of data blocks, andv) Terminate the programYou can use the Java in-built LinkedList class to implement the list allocation of thefile. You can also use the Scanner class to take inputs from the user. The sampleinput/ output and the corresponding list structure is given below:(30 points)Sample input/ output:(Let us assume the content of the given file is:Linked List allocation solves all problems of contiguousallocation. In linked list allocation, each file is consideredas the linked list of disk blocks.The above file content has 154 characters including spaces and punctuations. So,as per our requirements, four data blocks will be created initially. User's inputs areshown in bold.)Enter the file name: Assgn1_2.txtThe list allocation of the file is created in main memoryDirectory entryFileNo_of_blocksStartAssgn1_2.txt1004100Link d L itallo at iesolves alproblens of400cks.200300iguousallocation. Inlinked listallocation,eachfile isconsidered asthe linkedlist of diskcontblo Enter your choice: 3The latest content of the file:Linked List allocation solves all problems of contiguous allocation. In linked listallocation, each file is considered as the linked list of disk blocks.Enter your choice: 1Enter the new content: However, the disks blocks allocated to a particular fileneed not to be contiguous on the disk.The new content has been added at the end of the list allocation structure.Directory entryFileStartNo of blocksAssgn1_2.txt1005100Linked List200allocationsoives al2problems ofsnonsallocation. Idfile isconsidered asthe linkedlist of diek400cks. However,500ar file needlinked listallocation,eschthe disksnot to beblockscontiguous onthe disk.contallocsted tobloparticuiEnter your choice: 2After which sentence you want to insert a new line (number only): 2Enter the new line: The directory entry contains the starting and ending locationof the data blocks.The new content has been added after the 2nd line.Directory entryFileStartNo_of_blocksAssgn1_2.txt10082001guousallocation. InLiakod Lietfile iaconsidered aaallocationcks.solves alproblens ofar file neednot to becontiguous odlirked listthe linkedallocation,list of diskbloconteachhthe disk.700ng locationof the data600The directory800entry containathe startingand endiHowever, thedisks blocksallocated toa particulblocks.Enter your choice: 3The latest content of the file:Linked List allocation solves all problems of contiguous allocation. In linked listallocation, each file is considered as the linked list of disk blocks. The directory entrycontains the starting and ending location of the data blocks. However, the disksblocks allocated to a particular file need not to be contiguous on the disk.Enter your choice: 4Address of the first block: 100Total number of blocks: 8Enter your choice: 5Thank you!

Question

1:34 b a2. Different operating systems use different file allocation techniques to store files inthe secondary storage device such as HDD. One of the techniques is &#34;Linkedallocation&#34;. In this technique, each file is divided into several data blocks of samesize. Each data block has a link to its next block like a singly linked list. So, the datablocks are scattered on the disk. The directory contains a pointer to the starting andthe ending data block of a file. The diagram below depicts a sample linked allocationsystem of a file Abc.txt:Directory entryFileStartEndAbc.txt 100900Data900DataDatablock 1block 2Datablock 3block NWrite a Java program to implement the linked allocation of a given text fileAssgn1_2.txt (uploaded with the assignment) who's each block will containmaximum 50 characters. Read the content of the given file and store it in data blocks(maximum 50 characters per block). Now show a menu that will ask the user toi) add new content at the end of the list,ii) add new content at any position of the list,iii) print the whole content of the list,iv) print the address of the first data block and the total number of data blocks, andv) Terminate the programYou can use the Java in-built LinkedList class to implement the list allocation of thefile. You can also use the Scanner class to take inputs from the user. The sampleinput/ output and the corresponding list structure is given below:(30 points)Sample input/ output:(Let us assume the content of the given file is:Linked List allocation solves all problems of contiguousallocation. In linked list allocation, each file is consideredas the linked list of disk blocks.The above file content has 154 characters including spaces and punctuations. So,as per our requirements, four data blocks will be created initially. User's inputs areshown in bold.)Enter the file name: Assgn1_2.txtThe list allocation of the file is created in main memoryDirectory entryFileNo_of_blocksStartAssgn1_2.txt1004100Link d L itallo at iesolves alproblens of400cks.200300iguousallocation. Inlinked listallocation,eachfile isconsidered asthe linkedlist of diskcontblo Enter your choice: 3The latest content of the file:Linked List allocation solves all problems of contiguous allocation. In linked listallocation, each file is considered as the linked list of disk blocks.Enter your choice: 1Enter the new content: However, the disks blocks allocated to a particular fileneed not to be contiguous on the disk.The new content has been added at the end of the list allocation structure.Directory entryFileStartNo of blocksAssgn1_2.txt1005100Linked List200allocationsoives al2problems ofsnonsallocation. Idfile isconsidered asthe linkedlist of diek400cks. However,500ar file needlinked listallocation,eschthe disksnot to beblockscontiguous onthe disk.contallocsted tobloparticuiEnter your choice: 2After which sentence you want to insert a new line (number only): 2Enter the new line: The directory entry contains the starting and ending locationof the data blocks.The new content has been added after the 2nd line.Directory entryFileStartNo_of_blocksAssgn1_2.txt10082001guousallocation. InLiakod Lietfile iaconsidered aaallocationcks.solves alproblens ofar file neednot to becontiguous odlirked listthe linkedallocation,list of diskbloconteachhthe disk.700ng locationof the data600The directory800entry containathe startingand endiHowever, thedisks blocksallocated toa particulblocks.Enter your choice: 3The latest content of the file:Linked List allocation solves all problems of contiguous allocation. In linked listallocation, each file is considered as the linked list of disk blocks. The directory entrycontains the starting and ending location of the data blocks. However, the disksblocks allocated to a particular file need not to be contiguous on the disk.Enter your choice: 4Address of the first block: 100Total number of blocks: 8Enter your choice: 5Thank you!

Accepted Answer

Answered: Image /qna-images/answer/ca4499c5-94e4-49ff-a6a7-2a89e1b3ec06.jpg