Java Programming

Write an outline and logic for the following code: EMPTY = '-' BLACK = ‘X’ WHITE = ‘O’ BOARD_SIZE = 8 DIRECTIONS = [(0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1)]   def initialize_board():     board = [[EMPTY for _ in range(BOARD_SIZE)] for _ in range(BOARD_SIZE)]     board[3][3] = WHITE     board[3][4] = BLACK     board[4][3] = BLACK     board[4][4] = WHITE     return board   def print_board(board):     print("   1  2  3  4  5  6  7  8")     for i in range(BOARD_SIZE):         print(f"{i + 1} ", end="")         for j in range(BOARD_SIZE):             print(f" {board[i][j]}", end="")         print()   def is_valid_move(board, row, col, player):     if board[row][col] != EMPTY:         return False       for direction in DIRECTIONS:         dr, dc = direction         r, c = row + dr, col + dc         while 0 <= r < BOARD_SIZE and 0 <= c < BOARD_SIZE:             if board[r][c] == EMPTY:                 break             if board[r][c] == player:…

Please follow the instructions in the screenshots provided and use that to implement the code given below. Done in python 3.10 or later please.    class WeightedAdjacencyMatrix :    """A weighted graph represented as a matrix."""     __slots__ = ['_W']     def __init__(self, size, edges=[], weights=[]) :        """Initializes a weighted adjacency matrix for a graph with size nodes.         Graph is initialized with size nodes and a specified set of        edges and edge weights.                Keyword arguments:        size -- Number of nodes of the graph.        edges -- a list of ordered pairs (2-tuples) indicating the                 edges of the graph.  The default value is an empty list                 which means no edges by default.        weights -- a list of weights for the edges, which should be the same                   length as the edges list.  The position of a value in                   the weights list corresponds to the edge in the same                   position of…

I need help with my java compiler program by  Generating intermediate code from the AST, such as three-address code or bytecode   import java.util.*; public class SimpleCalculator { private final String input;private int position;private boolean hasDivByZero = false;private Map<String, String> symbolTable; public SimpleCalculator(String input) {    this.input = input;    this.position = 0;    this.symbolTable = new HashMap<>();} public static void main(String[] args) {    SimpleCalculator calculator = new SimpleCalculator("3 + 5 * (2 - 1)");    int result = calculator.parseExpression();    if (calculator.hasDivByZero) {        System.out.println("Error: division by zero");    } else {        System.out.println("Result: " + result);    }} public int parseExpression() {    int value = parseTerm();    while (true) {        if (consume('+')) {            value += parseTerm();        } else if (consume('-')) {            value -= parseTerm();        } else {…