Algorithm Analysis And Design Assignment, UITM, Malaysia Using The Brute-Force Approach, Solve The Knapsack Problem Above. Given A Set Of Points In A 2D Plane Below
Question 1
Max Weight = 25 
Using the brute-force approach, solve the knapsack problem above.
Question 2
Given a set of points in a 2D plane below:
Find a pair of points with the shortest distance between them using the brute force approach.
Question 3
Given the assignment problem above, find the optimal solution via a brute-force approach.
