The Affordable Care Act (ACA) requires all US citizens and legal residents to obtain qualifying health coverage. In this unit, you will explore the Individual Mandate section of the new health reform law. Tasks: · Explain the Individual Mandate included in the Patient Protection and ACA including the tax penalties that will be imposed if a person or a family does not obtain qualifying health coverage. · Analyze the eligibility criteria for exemptions and subsidies to obtain coverage. · Explain one policy change or enhancement you would recommend if you were required to ensure success of the Individual Mandate included in the Patient Protection and ACA and justify the intended outcome. Submission Details: · Submit your response in a 5- to 6-page Microsoft Word document formatted in APA style. /* * To change this license header, choose License Headers in Project Properties. * To change this template file, choose Tools | Templates * and open the template in the editor. */ package map; /** * * @author Zhongmei Yao */ import java.awt.Graphics; import javax.swing.JFrame; import javax.swing.JComponent; import java.awt.Color; public class Map { public static void draw(Graphics g) { Color arrColor[] = {Color.BLACK, Color.RED, Color.CYAN}; // you can choose colors you want /* fillOval(x, y, width, height): x - the x coordinate of the upper left corner of the oval to be drawn y - the y coordinate of the upper left corner of the oval width - the width of the oval height - the height of the oval */ int x = 0; int y = 0; int width = 30; int height = 30; // if width equals height, then it's a circle for (int i = 0; i < 6; i++) // draw 6 circles on a row { g.setColor(arrColor[i % 2]); g.fillOval(x + width * i, y, width, height); } g.setColor(arrColor[2]); // set color cyan // draw a red node at (400, 410): int x1 = 400; int y1 = 410; g.fillOval(x1, y1, width, height); // draw a red node at (500, 510): int x2 = 500; int y2 = 510; g.fillOval(x2, y2, width, height); g.setColor(arrColor[0]); // set color black // draw an edge connenting (x1, y1) and (x2, y2) g.drawLine(x1 + width/2, y1+ width/2, x2 + width/2, y2+ width/2); } // end of draw function public static void main(String[] args) { JFrame frame = new JFrame(); final int FRAME_WIDTH = 800; final int FRAME_HEIGHT = 800; frame.setSize(FRAME_WIDTH, FRAME_HEIGHT); frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); JComponent component = new JComponent() { public void paintComponent(Graphics graph) { draw(graph); } }; ...

1. The Affordable Care Act (ACA) requires all US citizens and
legal residents to obtain qualifying health coverage. In this unit,
you will explore the Individual Mandate section of the new
health reform law.
Tasks:
· Explain the Individual Mandate included in the Patient
Protection and ACA including the tax penalties that will be
imposed if a person or a family does not obtain qualifying
health coverage.
· Analyze the eligibility criteria for exemptions and subsidies to
obtain coverage.
· Explain one policy change or enhancement you would
recommend if you were required to ensure success of the
Individual Mandate included in the Patient Protection and ACA
and justify the intended outcome.
Submission Details:
· Submit your response in a 5- to 6-page Microsoft Word
document formatted in APA style.
/*
* To change this license header, choose License Headers in
Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
package map;

2. /**
*
* @author Zhongmei Yao
*/
import java.awt.Graphics;
import javax.swing.JFrame;
import javax.swing.JComponent;
import java.awt.Color;
public class Map
{
public static void draw(Graphics g)
{
Color arrColor[] = {Color.BLACK, Color.RED,
Color.CYAN}; // you can choose colors you want
/*
fillOval(x, y, width, height):

3. x - the x coordinate of the upper left corner of the oval to
be drawn
y - the y coordinate of the upper left corner of the oval
width - the width of the oval
height - the height of the oval
*/
int x = 0;
int y = 0;
int width = 30;
int height = 30; // if width equals height, then it's a circle
for (int i = 0; i < 6; i++) // draw 6 circles on a row
{
g.setColor(arrColor[i % 2]);
g.fillOval(x + width * i, y, width, height);
}
g.setColor(arrColor[2]); // set color cyan
// draw a red node at (400, 410):

4. int x1 = 400;
int y1 = 410;
g.fillOval(x1, y1, width, height);
// draw a red node at (500, 510):
int x2 = 500;
int y2 = 510;
g.fillOval(x2, y2, width, height);
g.setColor(arrColor[0]); // set color black
// draw an edge connenting (x1, y1) and (x2, y2)
g.drawLine(x1 + width/2, y1+ width/2, x2 + width/2, y2+
width/2);
} // end of draw function

5. public static void main(String[] args)
{
JFrame frame = new JFrame();
final int FRAME_WIDTH = 800;
final int FRAME_HEIGHT = 800;
frame.setSize(FRAME_WIDTH, FRAME_HEIGHT);
frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
JComponent component = new JComponent()
{
public void paintComponent(Graphics graph)
{
draw(graph);
}
};

6. frame.add(component);
frame.setVisible(true);
} // end of main function
}
1. Purpose
The purpose of this assignment is to implement graph
algorithms for finding the shortest path from a source node to a
destination node on a map.
Note: You CAN use ADTs such as TreeMap defined in Java
library for this assignment. See TreeMap at
https://docs.oracle.com/javase/7/docs/api/java/util/TreeMap.htm
l
2. Description
For this programming assignment, you will implement a graph
using an adjacency list representation. Your program will read
a graph from a file called map.txt. The file is a text file where
the first line contains two numbers. The first is the number of
vertices n and the second is the number of edges m. After this
line there will be n lines with three numbers representing node
locations on a map. The first number represent the vertex ID,
and the next two numbers representing (x, y) coordinates for the
vertex. Then there will be m lines with three numbers
representing edges and their weights. The first two numbers
represent the source and destination vertex for the undirected
edge. The third number is the weight for that edge. Your
program should ask the user to enter the source and the
destination and run Dijkstra’s shortest path algorithm to return
the shortest path from the source to the destination. An
example map.txt file would be:
4 5

7. 0 10 10 vertex 0’s location is at (10, 10)
1 90 40
2 30 10 vertex 1’s location is at (90, 40)
3 90 10
0 2 1 edge connecting nodes 0 and 2 with weight 1
1 2 5
2 3 3
1 3 2
0 3 10 edge connecting nodes 0 and 3 with weight 10
This file represents a graph with 4 vertices, 5 edges, and has
edges (0, 2) with weight 1, (1,2) with weight 5, (2,3) with
weight 3, (1,3) with weight 2, (0,3) with weight 10. The graph
is undirected; that is, for each edge (v, w), you should add v w
and w v with the same weight in your program. Your
program should output the shortest path (e.g., output the
shortest path between vertex 0 and vertex 3 as a sequence of
vertex labels 0, 2, 3). NOTE: The weight does NOT have to be
an integer. In general the weight will be a floating point
number.
3. Grading (100 points)
· If your program does not compile, you receive zero points for
this assignment.
· (20 points) You should implement the adjacency list data
structure for the graph.
· (20 points) You should use your own implementation of
Binary Heap for this assignment.
· (50 points) Be sure to test the correctness of your algorithms
and implementations.
· (10 points) Your code will be graded based on whether or not
it compiles, runs, produces the expected output, produces
correct output, and your coding style.
4. Bonus points (20 points)
Receive 20 bonus points if your program provides a GUI

8. (graphic user interface) that shows the graph (nodes, edges, and
edge weights) on a Java frame. The user can enter the source
and the destination. The GUI then colors the shortest path. The
basic 2D graphics GUI is given in
Map.java at isidore.
5. Turn in
• Zip your project, and turn in the zip file to isidore.