Create rotten_oranges.cpp

[surbhisharma004]

The "Rotten Oranges Theory" (or Rotten Oranges Problem) is a concept that can be applied to graph traversal algorithms, particularly in the context of breadth-first search (BFS). The problem is typically used to illustrate how contamination or infection spreads in a confined area over time.

The problem is often presented like this:

Imagine you have a grid (2D matrix) where each cell can represent three states:

Fresh oranges (represented as 1).
Rotten oranges (represented as 2).
Empty cells (represented as 0).
The goal is to determine how long it will take for all the fresh oranges to rot. The rotting spreads from one rotten orange to adjacent fresh oranges (up, down, left, right) every minute.