⚡ Bolt: Optimize priority distribution calculations

[keerthivinod]

💡 What: Replaced O(N*M) nested .filter().length array traversals inside .map() loops with a single O(N) .reduce() pass that generates a frequency hash map for DashboardModule.jsx and ReportsModule.jsx.
🎯 Why: To prevent multiple redundant iterations over the entire tickets array on every render cycle when calculating priority distributions.
📊 Impact: Reduces time complexity for calculating priority distributions from O(N * M) to O(N + M), significantly improving render speed for dashboards with a large number of tickets.
🔬 Measurement: Review the network and rendering time profiles to confirm that the distribution and priorityDist calculations are executed faster during subsequent re-renders.

---

PR created automatically by Jules for task 8023221782014684207 started by @keerthivinod

[google-labs-jules]

👋 Jules, reporting for duty! I'm here to lend a hand with this pull request.

When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down.

I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job!

For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with @jules. You can find this option in the Pull Request section of your global Jules UI settings. You can always switch back!

New to Jules? Learn more at jules.google/docs.

---

For security, I will only act on instructions from the user who triggered this task.