Please create a flow chart for the following

Create a flowchart foe the following problem: You have a file containing the grades of students from Beginning Programming, along with the students' information. Your part of the program has to loop through the records, and make sure that any student who has received a 'D', 'W', 'I', or 'F' in the course will not be able to move on to the Advanced Programming class.

Shortest Prefixes

Shortest Prefixes Input: Prefix .in Output: Prefix .out A prefix of a string is a substring string at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", car", "carb", "carbo", and "carbon". Note that the empty string is not considered a prefix in this problem, but every non-empty string is considered to be a prefix of itself. In everyday language, we tend to abbreviate words by prefixes. For example, "carbohydrate "is commonly abbreviated by "carb". In this problem, given a set of words, you will find for each word the shortest prefix that uniquely identifies the word it represents. In the sample input below, "carbohydrate" can be abbreviated to "carboh", b... click for more

enter up to 15 numbers and output the minimum number, maximum number and the geometric mean.

This program will take in 15 test scores and output the maximum score, the minimum score and the geometric mean of the scores.

Order of Complexity

The algorithm has the order of complexity shown, and takes the indicated time for a problem of size 50.0. Fill in the amount of time for the algorithm will take for the other sizes shown. Function Size 50 Size 51 Size 60 O(N ^ N) 1 second ______ ________

Order of Complexity Proof

Prove: f(n) + g(n) = θ(f(n)) if g(n) = o(f(n))