You are asked to be an organizer for n wedding parties and are provided with their start and end times. (For example: P1: 7 AM - 9 AM, P2:8 AM to 3 PMP3:4 AM to 8 AM) You can only be organizing one party at a time, so you need to choose parties with no overlapping times. For every party that you organize, you are given a fixed reward (1000$) irrespective of the length of the party. Describe an algorithm (pseudocode) to maximize your reward