How to solve this question

Suppose the values of different sizes of rectangular pieces of land are known
(presumed rounded to the nearest metre), and held in a two-dimensional array,
with the price for an m × n sized piece the same as for an n × m piece of land.
Also suppose a given rectangular piece of land can be subdivided into two (equal
or unequal sized) rectangular pieces by splitting parallel to one side at a cost
proportional to the length of the split.
The following diagram illustrates subdivisions of an M × N piece of land via
four splits to give five smaller pieces of land.
M
N 1
2
3
4
The purpose of this group assignment is to develop software that can determine the best way to progressively subdivide a plot of land of a given size to
maximize the overall value of the subdivision.
The assignment should include the following components:
Brute-force Approach which is a program that implements a brute-force approach to solving the subdivision problem that simply finds all valid subdivisions (eg finding them by using recursion) and calculates the overall
price. (12 marks)
Approximate Greedy Approach which is a program that demonstrates a
approximate approach to solving the subdivision problem, and which improves on the performance of the brute-force approach. Please include
comments in your program that clearly explain the approach you have
taken and good test cases. (12 marks)
Exact Approach which is a program that demonstrates an approach that
correctly and efficiently solves the subdivision problem. Please include
comments in your program that clearly explain the approach you have
taken, particularly why it works, and include good test cases that illustrate

Exact Approach which is a program that demonstrates an approach that
correctly and efficiently solves the subdivision problem. Please include
comments in your program that clearly explain the approach you have
taken, particularly why it works, and include good test cases that illustrate