Maximum Subscription Cost

Problem Statement

Maximum Subscription Cost Problem Description Amazon is designing a new subscription model for its cloud services. The company offers n types of base plans, with their respective costs stored in an array planCost , and m types of additional features, each with its own cost stored in an array featureCost . Customers can select one base plan and one additional feature. The total subscription cost is the sum of the base plan's cost and the feature's cost. However, there are X specific combinations of base plans and features that are not allowed due to technical restrictions. These incompatible combinations are represented by two arrays, incompatiblePlans and incompatibleFeatures , where incompatiblePlans[i] and incompatibleFeatures[i] represent the base plan and the additional feature that cannot be paired together, in 1-based indexing. Out of all possible valid combinations of a base plan and an additional feature, find the maximum cost of any valid combination. Note: the constraints gua