Consider a process P running in a Linux$-$like operating system that implements demand paging. The page$/$frame size in the system is $4$KB$.$ The process has $4$ pages in its heap. The process stores an array of $4$K integers $($size of integer is $4$ bytes$)$ in these $4$ pages. The process then proceeds to access the integers in the array sequentially. Assume that none of these $4$ pages of the heap are initially in physical memory. The memory allocation policy of the OS allocates only $3$ physical frames at any point of time, to the store these $4$ pages of the heap. In case of a page fault and all $3$ frames have been allocated to the heap of the process, the OS uses a LRU policy to evict one of these pages to make space for the new page. Approximately what percentage of the $4$K accesses to array elements will result in a page fault?