implement Bresenham line drawing algorithm: For Slope |m|<1: Either value of x is increased OR both x and y is increased using decision parameter.

Using pyhton coding to solve: Suppose the Great Frederick Fair wants to update its ticketing software. They need you to write a program to handle the price calculations, using the rules*: ● The basic price of a ticket is $40. Senior citizens (age >= 65) get a 50% discount. Children under 6 are free (100% discount). For residents of Frederick County, the basic price is $35; the same discounts still apply. So the individual ticket prices range from $0 to $40. ● . Your program should request age and county name from the user. The age will be entered as an integer and the county name as a string. Before calculating the price, confirm that the user's age is valid - not negative and not more than 110. If it is not, give a message and do not do the price calculation. Also, the county name should not be case sensitive - for example, Frederick, frederick, and FREDERICK should all be acceptable. Your program should then calculate and print out the ticket price, using the appropriate…

Bresenham's circle drawing technique requires a value of p, a decision parameter, to be determined. Bresenham's method for drawing a circle is detailed in this article.

In a row of seats, 1 represents a person sitting in that seat, and 0 represents that the seat is empty. There is at least one empty seat, and at least one person sitting. Alex wants to sit in the seat such that the distance between him and the closest person to him is maximized. Return that maximum distance to closest person. A. Example 1: i. Input: [1, 0, 0, 0, 1, 0, 1] ii. Output: 2 • Explanation: • If Alex sits in the second open seat (seats[2]), then the closest person has distance 2. • If Alex sits in any other open seat, the closest person has distance 1. • Thus, the maximum distance to the closest person is 2. NOTE: "using C++ code"

An object leaves point P1 with coordinates (−1,0) and travels with velocity v1=1 in a straight line to point P2 with coordinates (0,h) . It then travels with velocity v2=2 in a straight line from P2 to point P3 with coordinates (x , y ). Given x and y values there will be some optimal h value that minimizes the total travel time. Write a program in Scilab containing a function in the form function u = h(x,y) [your code goes here] endfunction u = h(1,2); disp(u); that calculates this optimal h value (to an accuracy of about 10^−6 ) given x and y values as arguments. Your function must work for any positive values of x and y.

Question 8 PS:Please answer them correctly.

Please provide a solution for the Knapsack Problem using Genetic Algorithm: