class. The StackUnderflowException class extends the Java Answer:

Add the method below to the parking office.java class.  Method getParkingCharges(Customer) : Money Parkingoffice.java public class ParkingOffice {String name;String address;String phone; List<Customer> customers;List<Car> cars;List<ParkingLot> lots;List<ParkingCharge> charges; public ParkingOffice(){customers = new ArrayList<>();cars = new ArrayList<>();lots = new ArrayList<>();charges = new ArrayList<>();}public Customer register() {Customer cust = new Customer(name,address,phone);customers.add(cust);return cust;}public Car register(Customer c,String licence, CarType t) {Car car = new Car(c,licence,t);cars.add(car);return car;}public Customer getCustomer(String name) {for(Customer cust : customers)if(cust.getName().equals(name))return cust;return null;}public double addCharge(ParkingCharge p) {charges.add(p);return p.amount;} public String[] getCustomerIds(){String[] stringArray1 = new String[2];for(int i=0;i<2;i++){stringArray1[i]…

The main question is the entire page labeled Program #1, the little screenshot is for extra steps. The program has to be written in Java.

import java.util.Scanner; public class Inventory {   public static void main (String[] args) {      Scanner scnr = new Scanner(System.in);             InventoryNode headNode;                                                    InventoryNode currNode;      InventoryNode lastNode;       String item;      int numberOfItems;      int i;       // Front of nodes list                                                                               headNode = new InventoryNode();      lastNode = headNode;       int input = scnr.nextInt();       for(i = 0; i < input; i++ ) {         item = scnr.next();         numberOfItems = scnr.nextInt();         currNode = new InventoryNode(item, numberOfItems);         currNode.insertAtFront(headNode, currNode);         lastNode = currNode;      }       // Print linked list                                                                         currNode = headNode.getNext();      while (currNode != null) {         currNode.printNodeData();         currNode…