PLEASE HELP WILL GIVE BRAINLIEST Instructions: Write a program to generate random passwords; the user should be able to select the length.

Folder titled SecretPasscode
Create a new project called 04.06 Password Generator in the Mod04 Assignments folder.
Create a class called SecretPasscode in the newly-created project folder.
Allow the user to select the number of characters in the password.
The minimum length allowed should be six.
Ensure the user's choice is valid.
Create a randomly generated password (must include uppercase, lowercase and numbers) and write it to a text file.
Utilize Math. random() and logical operators to create the range of values.
Use an ASCII chart to determine the range of numbers needed to generate the desired characters.
Use concatenation to build each password.
Allow the user to create multiple passwords without restarting the program.
When the user opts to stop, read the passwords from the text file and neatly display them on the screen.
Open the StarterCode406.java file to begin your program.
Suggestions: Make an outline on paper, use pseudocode, or diagram logic sections with a flowchart.
Expected Output: The output of the program should resemble the following screen shot:

)a grad student comes up with the following algorithm to sort an array a[1..n] that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array. 1: function g-sort(a, n) . takes as input an array of n numbers, a[1..n] 2: g-sort-recurse(a, 1, n) 3: end function 4: function g-sort-recurse(a, `, u) 5: if u ⒠` ≤ 0 then 6: return . 1 or fewer elements already sorted 7: else if u ⒠` = 1 then . 2 elements 8: if a[u] < a[`] then . swap values 9: temp ↠a[u] 10: a[u] ↠a[`] 11: a[`] ↠temp 12: end if 13: else . 3 or more elements 14: size ↠u ⒠` + 1 15: twothirds ↠d(2 ◠size)/3e 16: g-sort-recurse(a, `, ` + twothirds ⒠1) 17: g-sort-recurse(a, u ⒠twothirds + 1, u) 18: g-sort-recurse(a, `, ` + twothirds ⒠1) 19: end if 20: end function first (5 pts), prove that the algorithm correctly sorts the numbers in the array (in increasing order). after showing that it correctly sorts 1 and 2 element intervals, you may make the (incorrect) assumption that the number of elements being passed to g-sort-recurse is always a multiple of 3 to simplify the notation (and drop the floors/ceilings).

Knowing that the central portion of link bd has a uniform cross sectional area of 800 mm2 , determine the magnitude of the load p for which the normal stress in link bd is 50 mpa. (hint: link bd is a two-force member.) ans: p = 62.7 kn

1. which of the following is a search engine? a) mozilla firefox b)internet explorer c)google d)safari 2. which of the following statements is true? a) all search engines will provide the same results when you enter the same query. b) all search engines use the same amount of advertisements. c) some search engines are also browsers. d) search engines often provide different results, even when you enter the same query.