Question: The following program should display a single button that when clicked prints submitted. Fill in the blanks to complete the program. The second picture here
(3 points) The following program should display a single button that when elicked prints blanks to complete the program. Everything you need to fill the blanks is ei or is a variable in the incomplete program (eg frame, display, submit, etc.) Some wing list of be used to fill more than one blank. Every item is used at least once either in the following list of fragments Some items in the list may ActionEvent ActionListener addActionListener actionPerformed frame getcontentPane new Submit() import java.awt. event.*: class Submit implements ACTO e) t bie void alkPeAchron Evens System.out.printin("Submitted"): import javax.swing.* import java.awt.+ class SimpleButton [ public static void main(Stringt args) ( JFrame frame new JFrame ("simple Button") Container display fameomont Pane utton submit-new JButton ("Submit")i rame-pack () PramcsetVisible(true): Fill in the blanks has been clicked. (Hint: The method to add an ActionListener is addA prints the number times ctionlListenero).oer of times so this program so that each time the button is clicked it rt java.awt.*i mport javax.swing. import java.awt.event.* class HelloButton ( public static void main(Stringt1 args) t JFrame frame new JFrane ("HelloButton" Container pane -frame.getcontentPane O JButton theButton new JButton("click me"): pane.add add Achn Listeaer C frame-pack) frame.setVisible(true) class clicks implements ActionListener i public void actionPerformed (ActionEvent e (BONUS up to 3 points for overall quiz total for the quarter) Write a method, inOrderO, that takes an IntListElement list and returns true if the elements are in non-decreasing order. That means the element at osition i is less than or equal to the element at position i+1. The empty list is in order (return true) as is the list with ust one element. For full credit your solution should be recursive. You will receive 2 points for a correct non- ecursive solution
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
