Order Matching Engine

You are tasked with implementing a simplified stock order matching engine that processes a sequence of orders. Each order has a type (either buy or sell), a price (a positive float), and an amount (a positive integer). The engine should process orders in the order they arrive, following these rules:

• When a buy order arrives, attempt to match it with existing sell orders that have a price less than or equal to the buy order's price.
• When a sell order arrives, attempt to match it with existing buy orders that have a price greater than or equal to the sell order's price.

Orders may be partially matched. When matching two orders, a trade is executed for the minimum of the two amounts. The matched order in the order book is used to determine the trade price (i.e. the price of the order that was already waiting in the order book).

If after matching there is any remaining amount from the current order, it should be stored in the order book for future matching.

Your task is to implement a class OrderBook that supports at least the following method:

• process_order(order_type: str, price: float, amount: int) -> List[Dict]
  • This method takes the order details as input and returns a list of trade records resulting from processing the order. Each trade record should be a dictionary (or equivalent in your language) with at least the following keys:
    • amount: the quantity that was traded
    • price: the trade price (price of the order already in the order book)

Ensure your implementation efficiently handles the order matching, updates the order book correctly, and deals with partial matches where necessary.

Write your solution in the programming language of your choice. Test your implementation with various orders to demonstrate that the matching behavior and order storage work as expected.