Hello, I will make sure to thumbs up if you can help with my cs homework!

[DCD1.java]

import java.util.*; public class DCD1{ public static int[] generateSet(int[] coin_weights){ Random rand = new Random(); int genuine_weight = rand.nextInt(100); int defective_weight = rand.nextInt(genuine_weight-1); int defective_position = rand.nextInt(coin_weights.length); for (int i = 0; i

/* Add your logic below to find the defective coin using the brute force algorithm. It is acceptable to create a new method and call the method from here. */ } }

[

[DCD2.java]

import java.util.*; public class DCD2{ /* The Scale function implemented below computes the weight of the coins in the scale. Assume the scale is provided and the weights of the coin are computed in a constant time. */ public static int scale(int[] weights, int low, int high){ int sum = 0; for (int i =low ; i

/* Add your logic below to find the defective coin using the divide and conquer algorithm. It is acceptable to create a new method and call the method from here. */ } }

Write a Java program that implements a Defective Coin Detection program using a series of requirements outlined below. 1. The starter code files are provided inside the lab repository in files named, DCD1.java and DCD2. java. Here DCD refers to Defective Coin Detection. 2. ADD the following statement to all your code files including the files named DCD1.java and DCD2.java. This work is mine unless otherwise cited - Student Name 3. First, analyze the brute force algorithm that we discussed in class. Identify the asymptotic running time of this program. The brute force algorithm is provided below so as to cusily access il. Algorithm - Find Defective Coin (Win) Input - A set of coin weights associated with a collection of coins. Output. The position of the defective coin. 1: for i = 0 to n - 1 do 2: if Wi]