Breadcrumb Navigation

You are given a list of pages, where each page is represented as an object (or dictionary) with the following keys:

• id: A unique integer identifying the page.
• title: A string representing the page title.
• parent_id: The id of the parent page. This value will be null (or None) if the page is the root (i.e., the home page).

Your task is to write a function that accepts the list of pages and a target page id, and returns the breadcrumb path from the root page to the target page as a list (or array) of page titles. The breadcrumb path should list the titles starting from the root, followed by the child pages in the hierarchy leading to the target page. If the target page is not reachable from the root or if the input data is inconsistent (for example, containing cycles or missing links), the function should return an empty list.

For example, consider the following list of pages:

pages = [
    {'id': 1, 'title': 'Home', 'parent_id': None},
    {'id': 2, 'title': 'Products', 'parent_id': 1},
    {'id': 3, 'title': 'Electronics', 'parent_id': 2},
    {'id': 4, 'title': 'Books', 'parent_id': 2}
]

If the target page id is 3, the expected breadcrumb path is:

['Home', 'Products', 'Electronics']

Implement your solution in your preferred programming language. Consider edge cases such as:

• The target page does not exist.
• The target page exists but is not connected properly to the root page.
• The list of pages has cycles or inconsistent parent references.

Your solution should be efficient and handle large inputs gracefully.